Ten challenges in propositional reasoning and search

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1997, Pages 50-54

  Selman, Bart ^a   Kautz, Henry ^a   McAllester, David ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CORE AREA; ENCODINGS; SATISFIABILITY TESTING; STOCHASTIC SEARCH; SYSTEMATIC SEARCHES; TECHNICAL CHALLENGES;

ARTIFICIAL INTELLIGENCE;

EID: 84880687355     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Blum, A. and Furst, M.L. (1995). Fast planning through planning graph analysis. Proc. IJCAI-95, Canada.
2. Boufkhad, Y. (1996) Aspects probabilistes et algorithmiques du probleme de satisfiabilite. Ph.D. Thesis, Univ. of Paris, 1996.
3. Cook, S. and Mitchell, D., Finding Hard Instances of the Satisfiability Problem: A Survey. DIMACS Series in Discr. Math. and Theoretical Comp. Sci., (to appear)
4. Crawford, J.M. and Auton, L.D. (1993) Experimental suits on the cross-over point in satisfiability problems. AAAI-93 (1993) 21-27. (Ext. version in Artif. Intel.)
5. Crawford, J. and Baker, A.B. (1994). Experimental results on the application of satisfiability algorithms to scheduling problems. Proc. AAAI-94, Seattle, WA.
6. Crawford, J.M., Ginsberg, M., Luks, E., and Roy, A. (1996). Proc. KR-96, Boston, MA, 148-158.
7. Chvatal, V. and Szemeredi, E. (1988). Many hard examples for resolution. J. of the ACM, 35(4) (1988) 759-208.
8. Davis, M. and Putnam, H. (1960) A computing procedure for quantification theory. J. of the ACM, 7 (1960).
9. de la Tour, T. and Demri, S. (1995). On the complexity fo extending ground resolution with symmetry rules. Proc. IJCAI-95, Montreal Canada, 289-295.
10. Dubois, O., Andre, P., Boufkhad, V., and Carlier, J. SAT versus UNSAT. DIMACS Series in Discr. Math. and Theoretical Comp. Sci., Vol. 26, 1996, 415-433.
11. Fujita, M., Slaney, J., and Bennett, F. (1993). Automatic Generation of Results in Finite Algebra Proc. IJCAI, 1993.
12. Ginsberg, M. (1995). First Intl. Workshop on AI&OR. Timberline, Oregon, OR (1995).
13. Heken, A. (1985). The intractability of resolution. Theoretical Computer Science 39 (1985) 297-308.
14. Hooker, J.N. (1988). Hooker, J.N., Resolution vs. cutting plane solution of inference problems: Some computational experience. Oper. Res. Letter, 7(1) (1988) 1-7.
15. Johnson, D. (1996). Experimental Analysis of Algorithms: The Good, the Bad, and the Ugly. Invited Lecture, AAAI-96, Portland, OR.
16. See also http://www.research.att.com/ dsj/papers/exper.ps.
17. Larrabee, T. (1992) Efficient generation of test patterns using Boolean satisfiability, IEEE Trans. on CAD, vol 11, 1992, pp 4-15.
18. Kautz, H. and Selman, B. (1992) Planning as Satisfiability. Proceedings ECAI-92, Vienna, Austria, 1992, 359-363.
19. Kauts, H. and Selman, B. (1996) Pushing the envelope: planning, propositional logic, and stochastic search. Proc. AAAI-96, Portland, OR, 1996.
20. Mazure, B. Sais, L. Gregoire E. (1996). Boosting complete techniques thanks to local search methods. Proc. Math & AI, 1996.
21. Mitchell, D., Selman, B., and Levesque, H.J. (1992) Hard and easy distributions of SAT problems. Proc. AAAI-92, San Jose, CA (1992) 459-485.
22. Papadimitriou, C.H. (1993). Computational Complexity. Addison Wesley, 1993.
23. Selman, B., Kauts, H., and Cohen, B. (1994). Noise Strategies for Local Search. Proc. AAAI-94, Seattle, WA, 1994, 337-343.
24. Selman, B., Levesque, H.J., and Mitchell, D. (1992) A new method for solving hard satisfiability problems. Proc. AAAI-92, San Jose, CA, 440-446.
25. Trick, M. and Johnson, D. (Eds.) (1996) Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26.
26. For benchmarks, see URL: http://dimacs.rutgers.edu/Challenges/index.html.
27. Williams, B.C. and Nayak, P. (1996) A model-based approach to reactive self-systems. Proceedings AAAI-96, Portland, OR. 971-978.