On efficient computation of variable MUSes

DOI10.1007/978-3-642-31612-8_23MaRDI QIDQ2843335zbMATH OpenOpenAlexFDO

Authors Anton Belov, Alexander Ivrii, Arie Matsliah, Joao Marques-Silva

Publication date 12 August 2013

Published in Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10344/2761

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Theory and Applications of Models of Computation
• Efficient combination of decision procedures for MUS computation
• Towards efficient MUS extraction
• On computing the union of MUSes
• On improving MUS extraction algorithms

Cited in

(7)

• Fast, flexible MUS enumeration
• Theory and Applications of Models of Computation
• Minimal sets on propositional formulae. Problems and reductions
• Factoring Out Assumptions to Speed Up MUS Extraction
• Definability for model counting
• Speeding up MUS extraction with preprocessing and chunking
• Computing MUS-based inconsistency measures

This page was built for publication: On efficient computation of variable MUSes

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