Finding Guaranteed MUSes Fast
From MaRDI portal
Publication:3502716
DOI10.1007/978-3-540-79719-7_27zbMath1138.68555OpenAlexW1488424150MaRDI QIDQ3502716
Siert Wieringa, Hans van Maaren
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_27
Related Items (6)
Algorithms for computing minimal equivalent subformulas ⋮ On Improving MUS Extraction Algorithms ⋮ Faster Extraction of High-Level Minimal Unsatisfiable Cores ⋮ Does This Set of Clauses Overlap with at Least One MUS? ⋮ Efficient Combination of Decision Procedures for MUS Computation ⋮ Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
Cites Work
- Solution techniques for the large set covering problem
- Pivoting algorithms based on Boolean vector labeling
- Theory and applications of satisfiability testing -- SAT 2006. 9th international conference, Seattle, WA, USA, August 12--15, 2006. Proceedings.
- Local-search extraction of mUSes
- Planning as satisfiability: parallel plans and algorithms for plan search
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- Theory and applications of satisfiability testing. 8th international conference, SAT 2005, St Andrews, UK, June 19--23, 2005. Proceedings.
- Theory and Applications of Satisfiability Testing
- Interpolants and Symbolic Model Checking
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
This page was built for publication: Finding Guaranteed MUSes Fast