On computing the union of MUSes

DOI10.1007/978-3-030-24258-9_15MaRDI QIDQ2181933zbMATH OpenOpenAlexFDO

Authors Carlos Mencía, Oliver Kullmann, A. A. Ignatiev, Joao Marques-Silva

Publication date 20 May 2020

Full work available at URL https://cronfa.swan.ac.uk/Record/cronfa50334

Mathematics Subject Classification ID

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

Recommendations

• Efficient combination of decision procedures for MUS computation
• Theory and Applications of Satisfiability Testing
• Towards efficient MUS extraction
• FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
• Does This Set of Clauses Overlap with at Least One MUS?

Cited in

(14)

• Accelerating predicate abstraction by minimum unsatisfiable cores extraction
• Semantic relevance
• Approximate counting of minimal unsatisfiable subsets
• Local-search extraction of mUSes
• On efficient computation of variable MUSes
• Minimally unsatisfiable Boolean circuits
• On computing preferred MUSes and MCSes
• Finding Guaranteed MUSes Fast
• Computing minimally unsatisfiable subformulas: state of the art and future directions
• Computing MUS-based inconsistency measures
• Hashing-based approximate counting of minimal unsatisfiable subsets
• Explanations of unsatisfiability beyond minimal subsets
• Rotation based MSS/MCS enumeration
• Counting minimal unsatisfiable subsets

This page was built for publication: On computing the union of MUSes

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