Rapport (Rapport De Recherche) Année : 2018

Attempts to produce minimal Resolution refutations

Olivier Bailleux

Résumé

We address the challenge of searching minimal refutations proofs of inconsistent CNF formulae using the Resolution rule. We propose two algorithms which can only afford formulae of at most 5 variables with a desktop computer. A faster but incomplete algorithm is used to produce "hard" 5 variables 3CNF formulae though a stochastic greedy search. It allowed us to find formulae that can be refuted by producing clauses of at most 3 literals, but whose all minimal refutations contain at least one clause of 4 literals.

Fichier principal
Vignette du fichier
MinRefutation.pdf (820.86 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01877804 , version 1 (20-09-2018)

Licence

Identifiants

  • HAL Id : hal-01877804 , version 1

Citer

Olivier Bailleux. Attempts to produce minimal Resolution refutations. [Research Report] Université de Bourgogne; UFR Sciences et Techniques. 2018. ⟨hal-01877804⟩
72 Consultations
159 Téléchargements

Partager

  • More