Efficient combination of decision procedures for MUS computation

DOI10.1007/978-3-642-04222-5_21MaRDI QIDQ3655210zbMATH OpenOpenAlexFDO

Authors Cedric Piette, Youssef Hamadi, Lakhdar Sais

Publication date 7 January 2010

Published in Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04222-5_21

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Towards efficient MUS extraction
• On improving MUS extraction algorithms
• MUSer2: an efficient MUS extractor
• Local-search extraction of mUSes
• Theory and Applications of Satisfiability Testing

Cites work

• Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
• Deciding Bit-Vector Arithmetic with Abstraction
• Finding Guaranteed MUSes Fast
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1956569 (Why is no real title available?)
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(11)

• Using local search to find MSSes and MUSes
• On computing the union of MUSes
• Fast, flexible MUS enumeration
• On efficient computation of variable MUSes
• On improving MUS extraction algorithms
• Towards efficient MUS extraction
• MUSer2: an efficient MUS extractor
• Algorithms for computing minimal equivalent subformulas
• Accelerated deletion-based extraction of minimal unsatisfiable cores
• Parallel MUS extraction
• Factoring Out Assumptions to Speed Up MUS Extraction

Describes a project that uses

Uses Software

• AMUSE
• QUICKXPLAIN

This page was built for publication: Efficient combination of decision procedures for MUS computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655210)