Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68176OpenAlexW2494235144MaRDI QIDQ5325873FDOQ5325873

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

Recommendations

• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• A Preprocessor for Max-SAT Solvers
• Theory and Applications of Satisfiability Testing
• Applying Logic Synthesis for Speeding Up SAT

Mathematics Subject Classification ID

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

Cited In (18)

• Theory and Applications of Satisfiability Testing
• The state of SAT
• SATenstein: automatically building local search SAT solvers from components
• On preprocessing techniques and their impact on propositional model counting
• Predicate Elimination for Preprocessing in First-Order Theorem Proving
• Theory and Applications of Satisfiability Testing
• Reasoning with propositional logic: from SAT solvers to knowledge compilation
• Applying Logic Synthesis for Speeding Up SAT
• Blocked Clause Elimination for QBF
• Theory and Applications of Satisfiability Testing
• A Gröbner Basis Approach to CNF-Formulae Preprocessing
• Definability for model counting
• An overview of parallel SAT solving
• Simulating circuit-level simplifications on CNF
• Clause vivification by unit propagation in CDCL SAT solvers
• On the role of logical separability in knowledge compilation
• Compacting Boolean Formulae for Inference in Probabilistic Logic Programming
• Present and Future of Practical SAT Solving

Uses Software

• Chaff
• DIMACS

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 Q5325873)