Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5714769
DOI10.1007/11527695zbMATH Open1122.68610OpenAlexW2483910514MaRDI QIDQ5714769FDOQ5714769
Authors: Yogesh Mahajan, Zhaohui Fu, Sharad Malik 
Publication date: 16 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11527695
Recommendations
- Efficient SAT solving under assumptions
- On efficient algorithms for SAT
- scientific article; zbMATH DE number 1903342
- scientific article; zbMATH DE number 2090309
- Efficient SAT engines for concise logics: accelerating proof search for zero-one linear constraint systems
- Implementing efficient All solutions SAT solvers
- Empirical study of the anatomy of modern SAT solvers
Cited In (12)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
- On the power of clause-learning SAT solvers as resolution engines
- Algorithm runtime prediction: methods \& evaluation
- The incremental satisfiability problem for a two conjunctive normal form
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
- Topological configurations \((n_4)\) exist for all \(n\geq 17\)
- Formal Methods in Computer-Aided Design
- Zchaff2004
- zChaff
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Present and Future of Practical SAT Solving
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 Q5714769)
