B-Cubing: New Possibilities for Efficient SAT-Solving

@article{Babic2006BCubingNP,
  title={B-Cubing: New Possibilities for Efficient SAT-Solving},
  author={D. Babic and Jesse D. Bingham and A. Hu},
  journal={IEEE Transactions on Computers},
  year={2006},
  volume={55},
  pages={1315-1324}
}
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA (electronic design automation) applications, so the efficiency of SAT-solving is of great practical importance. B-cubing is our extension and generalization of Goldberg et al.'s supercubing, an approach to pruning in SAT-solving completely different from the standard approach used in leading solvers. We have built a B-cubing-based solver that is competitive with, and often outperforms, leading conventional… Expand
Constraint sequence solving for VLSI design
  • A. Bhalla
  • Mathematics
  • 2nd Asia Symposium on Quality Electronic Design (ASQED)
  • 2010
SPEAR Theorem Prover
Scalable Routing Modeling for Wireless Ad Hoc Networks by Using Polychromatic Sets
Knowledge acquisition: Past, present and future
  • B. Gaines
  • Computer Science
  • Int. J. Hum. Comput. Stud.
  • 2013
Polarity Consistency Checking for Domain Independent Sentiment Dictionaries
...
1
2
...

References

SHOWING 1-10 OF 36 REFERENCES
B-cubing theory: new possibilities for efficient SAT-solving
Efficient SAT solving: beyond supercubes
The Quest for Efficient Boolean Satisfiability Solvers
Propositional satisfiability algorithms in eda applications
Heuristic backtracking algorithms for SAT
Combinational test generation using satisfiability
Efficient conflict driven learning in a Boolean satisfiability solver
Enhancing Davis Putnam with extended binary clause reasoning
A two-phase algorithm for solving a class of hard satisfiability problems
Aligning CNF- and Equivalence-reasoning
...
1
2
3
4
...