B-Cubing: New Possibilities for Efficient SAT-Solving

@article{Babic2006BCubingNP,
  title={B-Cubing: New Possibilities for Efficient SAT-Solving},
  author={Domagoj Babic and Jesse D. Bingham and Alan J. 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… 
View on IEEE
zenodo.org
11 Citations
Background Citations
2
Methods Citations
2

Figures and Tables from this paper

11 Citations

Citation Type

Citation Type

Constraint sequence solving for VLSI design
  • A. Bhalla
  • Computer Science
    2nd Asia Symposium on Quality Electronic Design (ASQED)
  • 2010
TLDR
This paper presents a relaxation based constraint sequence solving technique applied to the backtrack step of backtrack search solver, with the goal of increasing the ability of the solver to search different parts of the search space.
Learning communicating and nondeterministic automata
TLDR
The main idea is to extend the L algorithm to cope with valid and invalid sets of system runs and come up with an intermediate design model (a DFA) which exhibits features that make it distributable into communicating components (or processes) interacting via FIFO channels.
Exploiting structure for scalable software verification
TLDR
Three novel ways to exploit structure at three different steps of the software analysis process are presented, showing how symbolic execution can preserve the data-flow dependencies of the original code while constructing compact symbolic representations of programs.
An adaptive method to tolerate soft errors in SRAM-based FPGAs
S PEAR Theorem Prover
SPEAR is a bit-vector arithmetic theorem prover designed for prov ing software verification conditions. The core of the theore m prover is a fast and simple SAT solver, which is described in this pap…
SPEAR Theorem Prover
SPEAR is a bit-vector arithmetic theorem prover designed for proving software verification conditions. The core of the theore m prover is a fast and simple SAT solver, which is described in this…
Scalable Routing Modeling for Wireless Ad Hoc Networks by Using Polychromatic Sets
TLDR
A scalable network modeling using PS-sets theory and a routing scheme based on this model are demonstrated, showing that it is simple and scalable, and its performance is superior to other conventional routing schemes.
Knowledge acquisition: Past, present and future
  • B. Gaines
  • Linguistics
    Int. J. Hum. Comput. Stud.
  • 2013
Polarity Consistency Checking for Sentiment Dictionaries
TLDR
The polarity consistency problem is reduced to the satisfiability problem and a fast SAT solver is utilized to detect inconsistencies in a sentiment dictionary.
Polarity Consistency Checking for Domain Independent Sentiment Dictionaries
TLDR
The concept of polarity consistency of words/senses in sentiment dictionaries is introduced and it is shown that the consistency problem is NP-complete.
...
...

References

SHOWING 1-10 OF 35 REFERENCES
B-cubing theory: new possibilities for efficient SAT-solving
TLDR
The theoretical basis for B-cubing is clarified, the approach is proved correct, and other correct possibilities for further improving SAT-solving are mapped out.
Efficient SAT solving: beyond supercubes
TLDR
On extensive benchmark runs, the new technique is competitive on average with the newest version of ZChaff, is much faster in some cases, and is more robust.
Propositional satisfiability algorithms in eda applications
TLDR
This dissertation presents a framework for analyzing the complexity of a SAT based formulation of the combinational ATPG problem, and develops a theory of essential points to formally characterize the potential search space pruning that can be realized by exploiting problem symmetry.
Heuristic backtracking algorithms for SAT
TLDR
The objective is to propose heuristic approaches to the backtrack step of backtrack search SAT solvers, with the goal of increasing the ability of the SAT solver to search different parts of the search space.
Combinational test generation using satisfiability
TLDR
The algorithm, Test Generation Using Satisfiability (TEGUS), solves a simplified test set characteristic equation using straightforward but powerful greedy heuristics, ordering the variables using depth-first search and selecting a variable from the next unsatisfied clause at each branching point.
Efficient conflict driven learning in a Boolean satisfiability solver
TLDR
This paper generalizes various conflict driven learning strategies in terms of different partitioning schemes of the implication graph to re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes.
Enhancing Davis Putnam with extended binary clause reasoning
TLDR
This paper experiments with a DPLL solver called 2CLS+EQ that makes more extensive use of binary clause reasoning than has been tried before and the results are very encouraging-2CLS-EQ is competitive with the very best DPLLsolvers.
A two-phase algorithm for solving a class of hard satisfiability problems
Aligning CNF- and Equivalence-reasoning
TLDR
This paper proposes a way to align these two reasoning devices by introducing parameters for which to establish optimal values over a variety of existing benchmarks, and obtains a truly convincing speed-up in solving structural logical formulas with respect to the best solving methods existing so far.
Effective Preprocessing with Hyper-Resolution and Equality Reduction
TLDR
This paper investigates the use of HypBinRes and equality reduction in a preprocessor that can be used to simplify a CNF formula prior to SAT solving, and presents empirical evidence demonstrating that such aPreprocessor can be extremely effective on large structured problems, making some previously unsolvable problems solvable.
...
...