Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5713708
DOI10.1007/b137280zbMath1128.68473OpenAlexW2497844642MaRDI QIDQ5713708
Mark H. Liffiton, Karem A. Sakallah
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
Fast, flexible MUS enumeration ⋮ Quantified maximum satisfiability ⋮ Symbolic Possibilistic Logic: Completeness and Inference Methods ⋮ Local-search extraction of mUSes ⋮ Finding Guaranteed MUSes Fast ⋮ Stream-based inconsistency measurement ⋮ MUST: Provide a Finer-Grained Explanation of Unsatisfiability ⋮ Reformulating table constraints using functional dependencies-an application to explanation generation ⋮ Algorithms for computing minimal unsatisfiable subsets of constraints ⋮ On semidefinite least squares and minimal unsatisfiability ⋮ Generalizing Core-Guided Max-SAT ⋮ Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems ⋮ A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas ⋮ Using local search to find MSSes and MUSes ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ SAT-based rigorous explanations for decision lists
Uses Software
This page was built for publication: Theory and Applications of Satisfiability Testing
