Integrating CNF and BDD based SAT solvers

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Eighth IEEE International High-Level Design Validation and Test Workshop

• Publication date

  2003-11-12

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/HLDVT.2003.1252474
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A machine program for theorem-proving

  2011cited by this paper
• Checking satisfiability of a conjunction of BDDs

  2003cited by this paper
• BerkMin: A fast and robust SAT-solver

  2002cited by this paper
• SAT with partial clauses and back-leaps

  2002cited by this paper
• Combinational equivalence checking using Boolean satisfiability and binary decision diagrams

  2001cited by this paper
• Chaff: engineering an efficient SAT solver

  2001influential reference
• Backtrack Search Using ZBDDs

  2001cited by this paper
• Multi-resolution on compressed sets of clauses

  2000cited by this paper
• SAT-Based Image Computation with Application in Reachability Analysis

  2000cited by this paper
• A BDD-based satisfiability infrastructure using the unate recursive paradigm

  2000cited by this paper
• ZRES: The Old Davis-Putman Procedure Meets ZBDD

  2000cited by this paper
• The Impact of Branching Heuristics in Propositional Satisfiability Algorithms

  1999cited by this paper
• Integrating a Boolean satisfiability checker and BDDs for combinational equivalence checking

  1998cited by this paper
• Tight integration of combinational verification methods

  1998cited by this paper
• Safe BDD Minimization Using Don't Cares

  1997cited by this paper
• SATO: An Efficient Propositional Prover

  1997cited by this paper
• Explicit and implicit algorithms for binate covering problems

  1997cited by this paper
• GRASP-A new search algorithm for satisfiability

  1996cited by this paper
• New Techniques for Efficient Verification with Implicitly Conjoined BDDs

  1994cited by this paper
• Ordered Binary Decision Diagrams and the Davis-Putnam Procedure

  1994cited by this paper
• Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems

  1993cited by this paper
• A new algorithm for the binate covering problem and its application to the minimization of Boolean relations

  1992cited by this paper
• Minimization of symbolic relations

  1990cited by this paper
• Efficient implementation of a BDD package

  1990cited by this paper
• Graph-based Algorithm for Boolean Function Manipulation

  1989cited by this paper
• A Rearrangement Search Strategy for Determining Propositional Satisfiability

  1988cited by this paper
• Logic Minimization Algorithms for VLSI Synthesis

  1984cited by this paper
• A Computing Procedure for Quantification Theory

  1960cited by this paper

• Satisfiability Advancements Enabled by State Machines

  2012cites this paper
• DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions

  2011cites this paper
• Studies on Applying Incremental SAT Solving to Optimization and Enumeration Problems

  2011cites this paper
• Towards Solving a System of Pseudo Boolean Constraints with Binary Decision Diagrams

  2008cites this paper
• A new generation of ISCAS benchmarks from formal verification of high-level microprocessors

  2004cites this paper
• Function-Complete Lookahead in Support of Efficient SAT Search Heuristics

  2004cites this paper