Approche hybride pour SAT
Résumé
In this article, a novel hybrid approach for propositional satisfiability problem, called SATHYS (SAT HYbrid Solver), is introduced. It combines local search and conflict driven clause learning (CDCL) schemes. At each time that a local minima is reached by the local search algorithm, a CDCL is launched. For satisfiable instances, the CDCL component behaves like a tabu list, whereas for unsatifiable ones, it tries to focus on minimum unsatisfiable subformula (MUS). It is shown in the experimental validation that this approach obtains good results on many classes of SAT instances issued from the last SAT competitions.
Domaines
Intelligence artificielle [cs.AI]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...