Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325873
DOI10.1007/B95238zbMATH Open1204.68176OpenAlexW2494235144MaRDI QIDQ5325873FDOQ5325873
Authors: Fahiem Bacchus, Jonathan Winter 
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
Cited In (20)
- 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
- Compacting Boolean formulae for inference in probabilistic logic programming
- Simplifying binary propositional theories into connected components twice as fast
- 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
- Theory and Applications of Satisfiability Testing
- Clause vivification by unit propagation in CDCL SAT solvers
- On the role of logical separability in knowledge compilation
- Present and Future of Practical SAT Solving
- Blocked clause elimination for QBF
Uses Software
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)
