Let the Solver Deal with Redundancy

Cédric Piette (1)

1 CRIL - Centre de Recherche en Informatique de Lens

Handling redundancy in propositional reasoning and search is an active path of theoretical research. For in- stance, the complexity of some redundancy-related prob- lems for CNF formulae and for their 2-SAT and Horn SAT fragments have been recently studied. However, this issue is not actually addressed in practice in modern SAT solvers, and is most of the time just ignored. Dealing with redun- dancy in CNF formulae while preserving the performance of SAT solvers is clearly an important challenge. In this pa- per, a self-adaptative process is proposed to manage redun- dant clauses, enabling redundant information to be discrim- inated and to keep only the one that proves useful during the search

Domaines: Intelligence artificielle [cs.AI]

Cédric Piette. Let the Solver Deal with Redundancy. 20th International Conference on Tools with Artificial Intelligence (ICTAI'08), 2008, Dayton, United States. pp.67-73. ⟨hal-00865304⟩