Réparation locale de réfutation de formules SAT - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Réparation locale de réfutation de formules SAT

Abstract

We address the problem of proving that a boolean formula is unsatisable. We present a local repair scheme which proves unsatisability by resolution. The main idea is to consider the linear proofs which number of allowed resolutions is bounded by a constant as being equivalent to constraint satisfaction problems (CSP), which solu- tions are refutations of the boolean formula. Therefore, any local repair technique applicable to CSP can be reu- sed, once dened the neighborhood of a "refutation to be repaired" and its proximity to a true refutation. We propose criteria to evaluate the proofs to be repaired and dene neighborhood operators that re-assign a va- riable of CSP (change of a clause) or swap the values of variables (move of a clause inside the proof).
Fichier principal
Vignette du fichier
prcovic.pdf (127.53 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

inria-00519164 , version 1 (18-09-2010)

Identifiers

  • HAL Id : inria-00519164 , version 1

Cite

Nicolas Prcovic. Réparation locale de réfutation de formules SAT. JFPC 2010 - Sixièmes Journées Francophones de Programmation par Contraintes, Jun 2010, Caen, France. pp.237-246. ⟨inria-00519164⟩
52 View
128 Download

Share

Gmail Facebook X LinkedIn More