Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68176OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325873

Jonathan Winter, Fahiem Bacchus

Publication date: 24 July 2009

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

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

Mathematics Subject Classification ID

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

Related Items (11)

On preprocessing techniques and their impact on propositional model counting ⋮ Compacting Boolean Formulae for Inference in Probabilistic Logic Programming ⋮ SATenstein: automatically building local search SAT solvers from components ⋮ The state of SAT ⋮ Simulating circuit-level simplifications on CNF ⋮ An overview of parallel SAT solving ⋮ Blocked Clause Elimination for QBF ⋮ Clause vivification by unit propagation in CDCL SAT solvers ⋮ Definability for model counting ⋮ Predicate Elimination for Preprocessing in First-Order Theorem Proving ⋮ Present and Future of Practical SAT Solving

Uses Software

• Chaff
• DIMACS

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