Finding Guaranteed MUSes Fast

DOI10.1007/978-3-540-79719-7_27MaRDI QIDQ3502716zbMATH OpenOpenAlexFDO

Authors Hans van Maaren, Siert Wieringa

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

Mathematics Subject Classification ID

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

Recommendations

• Finding a collection of MUSes incrementally
• Enumerating infeasibility: finding multiple MUSes quickly
• Local-search extraction of mUSes
• Using local search to find MSSes and MUSes
• Fast rendezvous with advice
• On computing the union of MUSes
• Fast, flexible MUS enumeration

Cites work

• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
• Detecting IIS in infeasible linear programmes using techniques from goal programming
• Interpolants and Symbolic Model Checking
• Local-search extraction of mUSes
• Pivoting algorithms based on Boolean vector labeling
• Planning as satisfiability: parallel plans and algorithms for plan search
• Solution techniques for the large set covering problem
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and applications of satisfiability testing -- SAT 2006. 9th international conference, Seattle, WA, USA, August 12--15, 2006. Proceedings.
• Theory and applications of satisfiability testing. 8th international conference, SAT 2005, St Andrews, UK, June 19--23, 2005. Proceedings.

Cited in

(15)

• Using local search to find MSSes and MUSes
• Finding all minimal safe inductive sets
• On exact selection of minimally unsatisfiable subformulae
• Approximate counting of minimal unsatisfiable subsets
• Finding a collection of MUSes incrementally
• On improving MUS extraction algorithms
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• Searching for Autarkies to Trim Unsatisfiable Clause Sets
• Efficient combination of decision procedures for MUS computation
• scientific article; zbMATH DE number 2080329 (Why is no real title available?)
• Algorithms for computing minimal equivalent subformulas
• Accelerated deletion-based extraction of minimal unsatisfiable cores
• Does This Set of Clauses Overlap with at Least One MUS?
• Theory and Applications of Satisfiability Testing
• Counting minimal unsatisfiable subsets

This page was built for publication: Finding Guaranteed MUSes Fast

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