Theory and Applications of Satisfiability Testing

DOI10.1007/B137280MaRDI QIDQ5713745zbMATH OpenOpenAlexFDO

Authors Maher Mneimneh, Inês Lynce, Zaher Andraus, Karem A. Sakallah, Joao Marques-Silva

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137280

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
• On improving MUS extraction algorithms
• Towards efficient MUS extraction
• Theory and Applications of Satisfiability Testing
• FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets

Cited in

(10)

• SAT-Based Formula Simplification
• Resolution proof transformation for compression and interpolation
• Quantified maximum satisfiability
• A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
• Algorithms for computing minimal unsatisfiable subsets of constraints
• An approach for extracting a small unsatisfiable core
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• Local-search extraction of mUSes
• MUST: Provide a Finer-Grained Explanation of Unsatisfiability

Describes a project that uses

Uses Software

• MUP

This page was built for publication: Theory and Applications of Satisfiability Testing

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