Using Boolean Constraint Propagation for Sub-clause Deduction - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Using Boolean Constraint Propagation for Sub-clause Deduction

Résumé

Boolean Constraint Propagation (BCP) is recognized as one of the most use- ful technique for efficient satisfiability checking. In this paper a new extension of the scope of boolean constraint propagation is proposed. It makes an original use of BCP to achieve further reduction of boolean formulas. Considering the impli- cation graph generated by the constraint propagation process as a resolution tree, sub-clauses from the original formula can be deduced. Then, we show how such extension can be grafted to modern SAT solvers where BCP is maintained at each step of the search tree. Preliminary results of “Zchaff” - the state of the art SAT solver - augmented with extended BCP, show the great potential of our approach with respect to certain classes of SAT instances
Fichier principal
Vignette du fichier
fullpaper-DDDMOG-CP05.pdf (139.48 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00396436 , version 1 (22-06-2009)

Identifiants

  • HAL Id : hal-00396436 , version 1

Citer

Sylvain Darras, Gilles Dequen, Laure Brisoux Devendeville, Bertrand Mazure, Richard Ostrowski, et al.. Using Boolean Constraint Propagation for Sub-clause Deduction. 11th International Conference on Principles and Practice of Constraint Programming (CP'05), Oct 2005, Sitges, Spain. pp.757-761. ⟨hal-00396436⟩
139 Consultations
900 Téléchargements

Partager

Gmail Facebook X LinkedIn More