Searching for Autarkies to Trim Unsatisfiable Clause Sets

DOI10.1007/978-3-540-79719-7_18zbMath1138.68545OpenAlexW1510851971MaRDI QIDQ3502707

Mark H. Liffiton, Karem A. Sakallah

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_18

Mathematics Subject Classification ID

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

Related Items (6)

Computing Maximal Autarkies with Few and Simple Oracle Queries ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ On Improving MUS Extraction Algorithms ⋮ Does This Set of Clauses Overlap with at Least One MUS? ⋮ Generalizing Core-Guided Max-SAT ⋮ Present and Future of Practical SAT Solving

Uses Software

• MiniSat
• AMUSE

This page was built for publication: Searching for Autarkies to Trim Unsatisfiable Clause Sets