Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68193DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325878FDOQ5325878

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

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

zbMATH Keywords

DAGSatisfiabilityBinary Decision DiagramState Machine

Mathematics Subject Classification ID

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

Cited In (11)

• Symbolic techniques in satisfiability solving
• Title not available (Why is that?)
• Diversifying a parallel SAT solver with Bayesian moment matching
• A finite state intersection approach to propositional satisfiability
• Fast set bounds propagation using a BDD-SAT hybrid
• Generating extended resolution proofs with a BDD-based SAT solver
• SBSAT
• Theory and Applications of Satisfiability Testing
• Generating Extended Resolution Proofs with a BDD-Based SAT Solver
• Non-clausal redundancy properties
• Variable and clause ordering in an FSA approach to propositional satisfiability

Uses Software

• zChaff
• Chaff
• BerkMin

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)