Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMath1122.68610OpenAlexW2483910514MaRDI QIDQ5714769

Yogesh Mahajan, Sharad Malik, Zhaohui Fu

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

Mathematics Subject Classification ID

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

Related Items

Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers, Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories, Algorithm runtime prediction: methods \& evaluation, The incremental satisfiability problem for a two conjunctive normal form, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, On the power of clause-learning SAT solvers as resolution engines, Zchaff2004, zChaff, Topological configurations \((n_4)\) exist for all \(n\geq 17\), Present and Future of Practical SAT Solving, On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving