Theory and Applications of Satisfiability Testing

DOI10.1007/11527695MaRDI QIDQ5714769zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

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

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)

• Formal Methods in Computer-Aided Design
• Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
• Topological configurations \((n_4)\) exist for all \(n\geq 17\)
• On the power of clause-learning SAT solvers as resolution engines
• Zchaff2004
• zChaff
• On using incremental encodings in unsatisfiability-based MaxSAT solving
• The incremental satisfiability problem for a two conjunctive normal form
• Algorithm runtime prediction: methods \& evaluation
• Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• 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)