Using failed local search for SAT as an oracle for tackling harder A.I. problems more efficiently

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2443 LNAI, Issue , 2002, Pages 51-60

  Grégoire, Éric ^a   Mazure, Bertrand ^a   Saïs, Lakhdar ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Local search; Logic and AI; Minimal models; SAT

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY;

COMPUTING TIME; HARD DECISIONS; LOCAL SEARCH; MINIMAL MODEL; OPTIMIZATION PROBLEMS; SAT SOLVERS; SUB-PROBLEMS; SYMBOLIC REASONING;

LOCAL SEARCH (OPTIMIZATION);

EID: 84877943796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46148-5_6     Document Type: Conference Paper

References (20)

1. S. Benferhat, C. Cayrol, D. Dubois, J. Lang, and H. Prade. Inconsistency management and prioritized syntax-based entailment. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI'93), pages 640-645, 1993.
2. Yacine Boufkhad and Olivier Roussel. Redundancy in random sat formulas. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI'00), pages 273-278, 2000.
3. James M. Crawford. Solving satisfiability problems using a combination of systematic and local search. In Working notes of the DIMACS Workshop on Maximum Clique, Graph Coloring, and Satisfiability, 1993.
4. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem proving. Journal of the Association for Computing Machinery, 5:394-397, 1962.
5. Second Challenge on Satisfiability Testing organized by the Center for Discrete Mathematics and Computer Science of Rutgers University, 1993. http://dimacs.rutgers.edu/Challenges/.
6. Éric Grégoire. Handling inconsistency efficiently in the incremental construction of stratified belief bases. In A. Hunter and S. Parsons, editors, Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU'99), volume 1638 of Lecture Notes in Computer Science, pages 168-178, London (UK), July 1999. Springer.
7. Éric Grégoire and David Ansart. Overcoming the christmas tree syndrome. International Journal on Artificial Aintelligence Tools (IJAIT), 9(2):97-111, 2000.
8. W. Hamscher, L. Console, and J. De Kleer. Readings in Model-Based Diagnosis. Morgan Kaufmann, 1992.
9. Pierre Hansen and Brigitte Jaumard. Algorithms for the maximum satisfiability problem. Journal of Computing, 22:279-303, 1990.
10. International Symposium on Circuits And Systems, 1985. http://www.eecs.umich.edu/~mhansen/imodels/ISCAS HLM.html.
11. Bertrand Mazure. De la Satisfaisabilité à la Compilation de Bases de Connaissances Propositionnelles. Thèse de doctorat, Université d'Artois, Centre de Recherche en Informatique de Lens (Faculté Jean Perrin), January 1999.
12. Bertrand Mazure, Lakhdar Saïs, and Éric Grégoire. Tabu search for SAT. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), pages 281-285, Providence (Rhode Island, USA), July 1997.
13. Bertrand Mazure, Lakhdar Saïs, and Éric Grégoire. Boosting complete techniques thanks to local search methods. Annals of Mathematics and Artificial Intelligence, 22:319-331, 1998.
14. Bertrand Mazure, Lakhdar Saïs, and Éric Grégoire. System Description: CRIL Platform for SAT. In Proceedings of the Fifteenth International Conference on Automated Deduction (CADE'15), volume 1421 of Lecture Notes in Artificial Intelligence, pages 116-119, Lindau (Germany), July 1998.
15. David A. McAllester, Bart Selman, and Henry A. Kautz. Evidence for invariants in local search. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), pages 321-326, August 1997.
16. J. McCarthy. Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence, 28:89-116, 1986.
17. P. Morris. The break out method for escaping from local minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI'93), pages 40-45, 1993.
18. R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32:57-95, 1987.
19. Bart Selman, Henry A. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In Working notes of the DIMACS Workshop on Maximum Clique, Graph Coloring, and Satisfiability, 1993.
20. Bart Selman, Hector J. Levesque, and David Mitchell. Gsat: A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92), pages 440-446, 1992.