Learning action models from plan examples using weighted MAX-SAT

Artificial Intelligence

Volumn 171, Issue 2-3, 2007, Pages 107-143

  Yang, Qiang ^a   Wu, Kangheng ^a,b   Jiang, Yunfei ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

Automated planning; Learning action models; Statistical relational learning

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING;

AUTOMATED PLANNING; LEARNING ACTION MODELS; STATISTICAL RELATIONAL LEARNING;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 33847340622     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.11.005     Document Type: Article

References (49)

1. Agrawal R., and Srikant R. Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB). Santiago de Chile, Chile (1994), Morgan Kaufmann 487-499
2. E. Amir, Learning partially observable deterministic action models, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2005), Edinburgh, Scotland, UK, August 2005, pp. 1433-1439
3. Bain M., and Sammut C. A framework for behavioural cloning. Machine Intelligence 15 (1996)
4. Benson S. Inductive learning of reactive action models. Proceedings of the International Conference on Machine Learning (ICML 1995) (1995), Stanford University, Stanford, CA 47-54
5. J. Blythe, J. Kim, S. Ramachandran, Y. Gil, An integrated environment for knowledge acquisition, in: Proceedings of the 2001 International Conference on Intelligent User Interfaces (IUI2001), Santa Fe, NM, 2001, pp. 13-20
6. Borchers B., and Furman J. http://infohost.nmt.edu/~borchers/maxsat.html
7. Borchers B., and Furman J. A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. Journal of Combinatorial Optimization 2 4 (1999) 299-306
8. Davis M., and Putnam H. A computing procedure for quantification theory. Journal of The Association for Computing Machinery 7 (1960) 201-215
9. P. Domingos, S. Kok, H. Poon, M. Richardson, P. Singla, Unifying logical and statistical AI, in: Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI 2006), Boston, MA, July 2006
10. K. Erol, J.A. Hendler, D.S. Nau, Htn planning: Complexity and expressivity, in: Proceedings of the National Conference on Artificial Intelligence (AAAI 1994), Seattle, WA, 1994, pp. 1123-1128
11. Kautz H., et al. http://www.cs.washington.edu/homes/kautz/walksat/
12. W.H. Evans, J.C. Ballegeer, N.H. Duyet, ADL: An algorithmic design language for integrated circuit synthesis, in: Proceedings of the 21st Design Automation Conference on Design Automation, 1984
13. Fikes R.E., and Nilsson N.J. Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2 (1971) 189-208
14. Fox M., and Long D. PDDL2.1: An extension to pddl for expressing temporal planning domains. Journal of Artificial Intelligence Research 20 (2003) 61-124
15. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company
16. A. Garland, N. Lesh, Plan evaluation with incomplete action descriptions, in: Proceedings of the Eighteenth National Conference on AI (AAAI 2002), Edmonton, Alberta, Canada, 2002, pp. 461-467
17. M. Ghallab, A. Howe, C. Knoblock, D. McDermott, A. Ram, M. Veloso, D. Weld, D. Wilkins, PDDL-the planning domain definition language, 1998
18. Y. Gil, Learning by experimentation: Incremental refinement of incomplete planning domains, in: Eleventh Intl. Conf. on Machine Learning, 1994, pp. 87-95
19. Goemans M.X., and Williamson D.P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42 (1995) 1115-1145
20. Grunwald P.D., Myung I.J., and Pitt M.A. Advances in Minimum Description Length Theory and Applications (2005), MIT Press, Cambridge, MA
21. Ilghami O., Munoz-Avila H., Nau D.S., and Aha D.W. Learning preconditions for planning from plan traces and HTN structure. Journal of Artificial Intelligence Research 20 (2003) 379-404
22. O. Ilghami, H. Munoz-Avila, D.S. Nau, D.W. Aha, Learning preconditions for planning from plan traces and htn structure, in: Proceedings of the International Conference on Machine Learning (ICML 2005), Bonn, Germany, 2005
23. O. Ilghami, D.S. Nau, H. Munoz-Avila, Camel: Learning method preconditions for htn planning, in: Proceedings of the Sixth International Conference on AI Planning and Scheduling AIPS-02, Toulouse, France, 2002, pp. 168-178
24. Jeroslow R.G., and Wang J. Solving propositional satisfiability problems. Annals of Mathematics and AI 1 (1990) 167-187
25. H. Kautz, B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search, in: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI 1996), Portland, OR, 1996, pp. 1194-1201
26. H. Kautz, B. Selman, Y. Jiang, A general stochastic approach to solving problems with hard and soft constraints, in: The Satisfiability Problem: Theory and Applications, 1997
27. Lau T., Domingos P., and Weld D.S. Version space algebra and its application to programming by demonstration. Proc. 17th International Conf. on Machine Learning (2000), Morgan Kaufmann, San Francisco, CA 527-534
28. Loveland D.W. Automated Theorem Proving: A Logical Basis (1978), North-Holland, New York
29. T. Leo McCluskey, D. Liu, R.M. Simpson, GIPO II: HTN planning in a tool-supported knowledge engineering environment, in: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS 2003), Trento, Italy, 2003, pp. 92-101
30. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an efficient sat solver, in: Proceedings of the 38th Design Automation Conference (DAC), 2001
31. Myers K.L., Jarvis P., Tyson W.M., and Wolverton M. Mixed-initiative framework for robust plan sketching. Thirteenth International Conference on Automated Planning and Scheduling (ICAPS-03). BC, Canada (2003), AAAI Press 256-266
32. Nau D.S., Au T.-C., Ilghami O., Kuter U., Murdock J.W., Wu D., and Yaman F. Shop2: An HTN planning system. Journal of Artificial Intelligence Research 20 (2003) 379-404
33. Nau D.S., Au T.-C., Ilghami O., Kuter U., Murdock J.W., Wu D., and Yaman F. Applications of shop and shop2. IEEE Intelligent Systems 20 2 (2005) 34-41
34. T. Oates, P.R. Cohen, Searching for planning operators with context-dependent and probabilistic effects, in: Proceedings of the Thirteenth National Conference on AI (AAAI 1996), Portland, OR, 1996, pp. 865-868
35. M. Richardson, P. Domingos, Markov logic networks, Technical Report, 2004
36. Richardson M., and Domingos P. Markov logic networks. Machine Learning 62 1-2 (July 2006) 107-136
37. Sablon G., and Boulanger D. Using the event calculus to integrate planning and learning in an intelligent autonomous agent. Current Trends in AI Planning (1994), IOS Press 254-265
38. B. Selman, H. Kautz, An empirical study of greedy local search for satisfiability testing, in: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), Washington, DC, 1993, pp. 46-51
39. Selman B., Kautz H., and Cohen B. Local search strategies for satisfiability testing. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge 26 (October 11-13, 1993)
40. D. Shahaf, E. Amir, Learning partially observable action schemas, in: Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI 2006), Boston, MA, July 2006
41. D. Shahaf, A. Chang, E. Amir, Learning partially observable action models: Efficient algorithms, in: Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI 2006), Boston, MA, July 2006
42. Shen W. Autonomous Learning from the Environment (1994), Computer Science Press/W.H. Freeman and Company
43. X. Wang, Learning by observation and practice: An incremental approach for planning operator acquisition, in: Proceedings of the Twelfth International Conference on Machine Learning (ICML 1995), 1995, pp. 549-557
44. E. Winner, M. Veloso, Analyzing plans with conditional effects, in: Proceedings of the Sixth International Conference on AI Planning and Scheduling (AIPS 2002), Toulouse, France, 2002.
45. Yang Q. Formalizing planning knowledge for hierarchical planning. Computational Intelligence Journal 6 2 (1990) 12-24
46. Q. Yang, K. Wu, Y. Jiang, Learning action models from plan examples with incomplete knowledge, in: Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), Monterey, CA, 2005, pp. 241-250
47. J. Yin, D. Shen, Q. Yang, Z.-N. Li, Activity recognition through goal-based segmentation, in: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), Pittsburgh, PA, 2005, pp. 28-34
48. J. Yin, Q. Yang, Integrating hidden Markov models and spectral analysis for sensory time series clustering, in: Proceedings of the Fifth IEEE International Conference on Data Mining, Houston, TX, 2005
49. H. Zhang, SATO: An efficient propositional prover, in: Proceedings of the 14th International Conference on Automated Deduction (CADE 1997), Townsville, North Queensland, Australia, 1997, pp. 272-275