Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325878zbMATH OpenOpenAlexDBLPFDO

Authors Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet, John V. Franco

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

zbMATH Keywords

Binary Decision DiagramDAGSatisfiabilityState Machine

Mathematics Subject Classification ID

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

Recommendations

• Theory and Applications of Satisfiability Testing
• BerkMin: A fast and robust SAT-solver
• scientific article; zbMATH DE number 5605058
• Progress in Artificial Intelligence
• Symbolic techniques in satisfiability solving

Cited in

(12)

• SBSAT
• A BDD SAT solver for satisfiability testing: An industrial case study
• Generating extended resolution proofs with a BDD-based SAT solver
• Non-clausal redundancy properties
• Fast set bounds propagation using a BDD-SAT hybrid
• A finite state intersection approach to propositional satisfiability
• scientific article; zbMATH DE number 1926658 (Why is no real title available?)
• Variable and clause ordering in an FSA approach to propositional satisfiability
• Theory and Applications of Satisfiability Testing
• Generating Extended Resolution Proofs with a BDD-Based SAT Solver
• Diversifying a parallel SAT solver with Bayesian moment matching
• Symbolic techniques in satisfiability solving

Describes a project that uses

Uses Software

• Chaff
• BerkMin
• zChaff

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