Compute-intensive methods in artificial intelligence

Annals of Mathematics and Artificial Intelligence

Volumn 28, Issue 1-4, 2000, Pages 35-38

  Selma, Bart ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034362289     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. J.A. Boyan and A.W. Moore, Learning evaluation functions for global optimization and Boolean satisfiability, in: Proc. 15th National Conference on Artificial Intelligence (AAAI), Madison, WI (1998).
2. M. Cadoli and F.M. Donini, A survey on knowledge compilation, AI Communications (1998).
3. P. Cheeseman, B. Kanefsky, M. Taylor and M. William, Where the really hard problems are, in: Proc. IJCAI-91 (1991) pp. 331-336.
4. T. Hogg, B.A. Huberman and C.P. Williams, Phase transitions in problem solving, Artificial Intelligence (Special Issue) 81 (1996).
5. Y. Huang, B. Selman and H. Kautz, Control knowledge in planning: benefits and tradeoffs, in: Proc. of the 16th Natl. Conf. on Artificial Intelligence (AAAI-99), Orlando, FL (1999).
6. Y. Huang, B. Selman and H. Kautz, Learning declarative control rules for constraint-based planning, Under review for Machine Learning (2000).
7. G. Kasparov, The day that I sensed a new kind of intelligence, Time, May 26 (1997) 66-67. See also Time, March 25 (1996) 55.
8. G. Kasparov, The day that I sensed a new kind of intelligence, Time, May 26 (1997) 66-67. See also Time, March 25 (1996) 55.
9. H. Kautz and B. Selman, An empirical evaluation of knowledge compilation, in: Proc. of the 12th Natl. Conf. on Artificial Intelligence (AAAI-94), Seattle, WA (1994) pp. 155-161.
10. H. Kautz and B. Selman, Pushing the envelope: planning, propositional logic, and stochastic search, in: Proc. of the 13th Natl. Conf. on Artificial Intelligence (AAAI-96), Portland, OR (1996) pp. 1194-1201.
11. H. Kautz and B. Selman, Unifying SAT-based and graph-based planners, in: Proc. of the 15th Intl. Joint Conf. on Artificial Intelligence (IJCAI-99) (1999).
12. S. Kirkpatrick and B. Selman, Critical behavior in the satisfiability of random Boolean expressions, Science 264 (1994) 1297-1301.
13. G. Kolata, Computer math proof shows reasoning power, New York Times, December 10 (1996).
14. W. McCune, Solution of the Robbins problem, Journal of Automated Reasoning 19(3) (1997) 263-276.
15. D. McDermott, Yes, computers can think, New York Times, May 14 (1997). See ftp://ftp.cs.yale. edu/pub/mcdermott/papers/deepblue.txt.
16. D. Mitchell, B. Selman and H. Levesque, Hard and easy distribution of SAT problems, in: Proc. 10th Natl. Conf. on Artificial Intelligence (AAAI-92), San Jose, CA (1992) pp. 459-465.
17. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky, Determining computational complexity from characteristic 'phase transitions', Nature 400(8) (1999) 133-137.
18. B. Selman, Near-optimal plans, tractability, and reactivity, in: Proc. of the 4th Int. Conf. on Knowledge Representation and Reasoning (KR-94), Bonn, Germany (1994) pp. 521-529.
19. B. Selman, Stochastic search and phase transitions: AI meets physics, in: Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Canada (1995).
20. B. Selman, R. Brooks, T. Dean, E. Horvitz, T. Mitchell and N. Nilsson, Challenge problems for artificial intelligence, in: Proc. of the 13th Natl. Conf. on Artificial Intelligence (AAAI-96), Portland, OR (1996) pp. 193-224.
21. B. Selman and H. Kautz, Knowledge compilation using Horn approximations, in: Proc. of the 9th Natl. Conf. on Artificial Intelligence (AAAI-91), Boston, MA (1991) pp. 904-909.
22. B. Selman and H. Kautz, Knowledge compilation and theory approximation, Journal of the ACM 43(2) (1996) 193-224.
23. B. Selman, H. Kautz and B. Cohen, Local search strategies for satisfiability testing, in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26 (Amer. Math. Soc., Providence, RI, 1993) pp. 521-532.
24. B. Selman, H. Kautz and D. McAllester, Computational challenges in propositional reasoning and search, in: Proc. IJCAI-97, Nagoya, Japan (1997).
25. B. Selman, H. Levesque and D. Mitchell, GSAT: A new method for solving hard satisfiability problems, in: Proc. 10th Natl. Conf. on Artificial Intelligence (AAAI-92), San Jose, CA (1992) pp. 440-446.
26. D. Weld, Recent advances in AI planning, Artificial Intelligence Magazine 20 (1999) 93-123.
27. W. Zhang and T.G. Dietterich, High-performance job-shop scheduling with a time-delay TD(lambda) network, Advances in Neural Information Processing Systems 8 (1996) 1024-1030.