• Corpus ID: 15342470

A backbone-search heuristic for efficient solving of hard 3-SAT formulae

@inproceedings{Dubois2001ABH,
  title={A backbone-search heuristic for efficient solving of hard 3-SAT formulae},
  author={Olivier Dubois and Gilles Dequen},
  booktitle={International Joint Conference on Artificial Intelligence},
  year={2001},
  url={https://api.semanticscholar.org/CorpusID:15342470}
}
A heuristic search for variables belonging to the backbone of a 3-SAT formula which are chosen as branch nodes for the tree developed by a DPL-type procedure is defined, making it possible to handle unsatisfiable hard 3- SAT formulae up to 700 variables.
users.encs.concordia.ca
168 Citations
Highly Influential Citations
14
Background Citations
57
Methods Citations
46
Results Citations
2

Figures and Tables from this paper

168 Citations

A Backbone-Based Co-evolutionary Heuristic for Partial MAX-SAT

This study is concerned with the PMSAT solution in setting a co-evolutionary stochastic local search algorithm guided by an estimated backbone variables of the problem and results suggest that this approach can outperform state-of-the-art PMS AT techniques.

kcnfs: An Efficient Solver for Random k-SAT Formulae

Experimental results show that kcnfs outperforms by far the best current complete solvers on any random k-SAT formula for k ≥ 3, and introduces a sub-heuristic called a re-normalization heuristic in order to handle formulae with various clause lengths.

An Efficient Approach to Solving Random k-sat Problems

This paper presents a solving heuristic, devoted essentially to proving the unsatisfiability of random $k-$sat formulae and inspired by recent work in statistical physics, which has shown a substantial jump in the efficiency of solving hard, unsatisfiable random $ k-$satformulae.

Algorithms for computing backbones of propositional formulae

This article overviews existing algorithms for backbone computation and introduces two novel ones, and demonstrates that one of the novel algorithms significantly outperforms the existing ones.

Applying Extended Resolution and Forced Patterns on Random 3-SAT instances

This study applies a technique known as extended resolution on uniform random 3SAT formulae; it adds additional clauses, derived from the original formula, trying to guide the solver into the direction of a viable solution.

Approximating the Backbone in the Weighted Maximum Satisfiability Problem

This paper investigated the computational complexity for retrieving the backbone in weighted MAX-SAT and developed a new algorithm for solving this problem and presented a backbone guided local search (BGLS), which outperforms the existing heuristics in both solution quality and runtime.

Optimizing backbone filtering

This paper proposes an optimized approach that combines implication-driven (IDF), conflict- driven (CDF), and unique-driven(UDF) heuristics to improve backbone computing and demonstrates that the advantage of DUCIBone is more obvious when the formulas are harder.

The Quest for Efficient Boolean Satisfiability Solvers

This paper examines some of the main ideas along this passage that have led to the current capabilities of the basic DPLL search framework, and focuses on techniques with consistent demonstrated efficiency in available solvers.

On Computing Generalized Backbones

This work proposes a natural generalization of backbones to the context of satisfiability modulo theories (SMT), applicable to a range of different theories as well as CSPs in general, and provides two generic algorithms for determining the backbone in this general context.

Selecting Complementary Pairs of Literals

...

14 References

Hard Random 3-SAT Problems and the Davis-Putnam Procedure

On the limit of branching rules for hard random unsatisfiable 3-SAT

Using CSP Look-Back Techniques to Solve Real-World SAT Instances

The results show that incorporating CSP look-back techniques renders easy many problems which otherwise are beyond DP's reach, and recommend that such techniques be included as options in implementations of DP, just as they are in systematic algorithms for the more general constraint satisfaction problem.

The NP-Completeness Column: An Ongoing Guide

SATO: An Efficient Propositional Prover

The scaling window of the 2‐SAT transition

Using this order parameter, it is proved that the 2‐SAT phase transition is continuous with an order parameter critical exponent of 1 and the values of two other critical exponents are determined, showing that the exponents of 2-SAT are identical to those of the random graph.

Experimental Results on the Crossover Point inSatis ability

It is found that for random 3-SAT problems below the crossover point, the average time complexity of satissability problems seems empirically to grow linearly with problem size, and at and above therossover point the complexity seems to grow exponentially, but the rate of growth seems to be greatest near the crossoverpoint.

Length of Prime Implicants and Number of Solutions of Random CNF Formulae

Hard and Easy Distributions of SAT Problems

It is shown that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite difficult.

The SAT phase transition

It is proved that asr (ratio of clauses to variables) increases, the structure of solutions will undergo a sudden change like satisfiability phase transition whenr reaches a threshold point (r=rσ).