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

DOI10.1007/BF02127973zbMath0891.68003OpenAlexW2019049230MaRDI QIDQ1380431

Ruchir Puri, Jun 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

satisfiability problemconstraint satisfactionVLSI engineering

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cites Work

• Computational experience with an interior point algorithm on the satisfiability problem
• Resolution vs. cutting plane solution of inference problems: Some computational experience
• Some results and experiments in programming techniques for propositional logic
• Graph-Based Algorithms for Boolean Function Manipulation
• An Average Time Analysis of Backtracking
• Average Time Analysis of Clause Order Backtracking
• Binary Decision Diagrams
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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