A BDD SAT solver for satisfiability testing: An industrial case study

DOI10.1007/BF02127973MaRDI QIDQ1380431zbMATH OpenOpenAlexFDO

Authors Ruchir Puri, J. Gu

Publication date 19 July 1998

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02127973

zbMATH Keywords

constraint satisfactionsatisfiability problemVLSI engineering

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 5605058
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Propositional SAT solving

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 30299 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 549930 (Why is no real title available?)
• scientific article; zbMATH DE number 1113993 (Why is no real title available?)
• scientific article; zbMATH DE number 776082 (Why is no real title available?)
• scientific article; zbMATH DE number 805390 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A Machine-Oriented Logic Based on the Resolution Principle
• A machine program for theorem-proving
• An Average Time Analysis of Backtracking
• Average Time Analysis of Clause Order Backtracking
• Binary Decision Diagrams
• Computational experience with an interior point algorithm on the satisfiability problem
• Graph-Based Algorithms for Boolean Function Manipulation
• Resolution vs. cutting plane solution of inference problems: Some computational experience
• Some results and experiments in programming techniques for propositional logic
• The complexity of theorem-proving procedures

Cited in

(3)

• Fast set bounds propagation using a BDD-SAT hybrid
• Computer Aided Verification
• Theory and Applications of Satisfiability Testing

This page was built for publication: A BDD SAT solver for satisfiability testing: An industrial case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380431)