Domain-dependent knowledge in answer set planning

ACM Transactions on Computational Logic

Volumn 7, Issue 4, 2006, Pages 613-657

  Son, Tran Cao ^a,d   Baral, Chitta ^b,e   Tran, Nam ^b,e   Mcilraith, Sheila ^c  

^a NEW MEXICO STATE UNIVERSITY   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

^d New Mexico State University   (United States)

^e Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; SEMANTICS; SET THEORY;

CONTROL KNOWLEDGE; DOMAIN-DEPENDENT RULES; SET PLANNING; SET SEMANTICS;

LOGIC PROGRAMMING;

EID: 33750197653     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1183278.1183279     Document Type: Article

References (54)

1. BABOVICH, Y. AND LIFSCHITZ, V. Computing answer sets using program completion.
2. BACCHUS, F. AND KABANZA, F. 2000. Using temporal logics to express search control knowledge for planning. Artif. Intel. 116, 1,2, 123-191.
3. BACCHUS, F., KAUTZ, H., SMITH, D., LONG, D., GEFFNER, H., AND KOEHLER, J. 2000. AIPS-00 Planning Competition. In proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling Systems.
4. BARAL, C. 1995. Reasoning about actions:Non-deterministic effects, constraints and qualification. In Proceedings of the 14th International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Francisco, CA, 2017-2023.
5. BARAL, C. 2003. Knowledge Representation, Reasoning, and Declarative Problem Solving with Answer Sets. Cambridge University Press, Cambridge, MA.
6. BARAL, C. AND SON, T. C. 1999. Extending ConGolog to allow partial ordering. In Proceedings of the 6th International Workshop on Agent Theories, Architectures, and Languages (ATAL). Lecture Notes in Computer Science, vol. 1757. Springer-Verlag, New York, 188-204.
7. BLUM, A. AND FURST, M. 1997. Fast planning through planning graph analysis. Artif. Intel. 90, 281-300.
8. BONET, B. AND GEFFNEH, H. 2001. Planning as heuristic search. Artif. Intel. (Special issue on Heuristic Search) 129, 1-2, 5-33.
9. BURGARD, W., CREMERS, A. B., Fox, D., HÄHNEL, D., LAKEMEYER, G., SCHULZ, D., STEINER, W., AND THRUN, S. 1998. The interactive museum tour-guide robot. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98). AAAI Press, Philadelphia, PA, 11-18.
10. BYLANDER, T. 1994. The computational complexity of propositional STRIPS planning. Artif. Intel. 69, 161-204.
11. CHAPMAN, D. 1987. Planning for conjunctive goals. Artif. Intel. 32, 3, 333-377.
12. DANTSIN, E., EITER, T., GOTTLOB, G., AND VORONKOV, A. 2001. Complexity and expressive power of logic programming. ACM Comput. Surv. 33, 3 (Sept.), 374-425.
13. DE GIACOMO, G., LESPÉRANCE, Y., AND LEVESQUE, H. 2000. ConGolog, a concurrent programming language based on the situation calculus. Artifi. Intel. 121, 1-2, 109-169.
14. DIMOPOULOS, Y., NEBEL, B., AND KOEHLEH, J. 1997. Encoding planning problems in nonmonotonic logic programs. In Proceedings of European Conference on Planning. 169-181.
15. DOHERTY, P. AND KVARNSTOM, J. 1999. TALplanner: An empirical investigation of a temporal logic-based forward chaining planner. In Proceedings of the 6th International Workshop on the Temporal Representation and Reasoning (Orlando, FL). (TIME'99).
16. EITER, T., FABER, W., LEONE, N., PFEIFER, G., AND POLLERES, A. 2000. Planning under incomplete information. In Proceedings of the 1st International Conference on Computational Logic (CL'00). Lecture Notes in Artificial Intelligence, vol. 1861. Springer-Verlag, New York, 807-821.
17. EITER, T., LEONE, N., MATEIS, C., PFEIFER, G., AND SCARCELLO, F. 1998. The KR system dlv: Progress report, comparisons, and benchmarks. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, 406-417.
18. EROL, K., NAU, D., AND SUBRAHMANIAN, V. 1995. Complexity, decidability and undecidability results for domain-independent planning. Artif. Intel. 76, 1-2, 75-88.
19. FIKES, R. AND NILSON, N. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artif. Intel. 2, 3-4, 189-208.
20. GELFOND, M. AND LEONE, N. 2002. Logic programming and knowledge representation - The A-Prolog perspective. Artif. Intel. 138, 1-2, 3-38.
21. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Logic Programming Proceedings of the 5th International Conference and Symposium, R. Kowalski and K. Bowen, Eds. 1070-1080.
22. GELFOND, M. AND LIFSCHITZ, V. 1993. Representing actions and change by logic programs. J. Logic Prog. 17, 2,3,4, 301-323.
23. GELFOND, M. AND LIFSCHITZ, V. 1998. Action languages. ETAI 3, 6.
24. HOFFMANN, J. AND NEBEL, B. 2001. The FF planning system: Fast plan generation through heuristic search. J. Artif. Intel. Res. 14, 253-302.
25. HUANG, Y., SELMAN, B., AND KAUTZ, H. 1999. Control knowledge in planning: Benefits and tradeoffs. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99). AAAI Press, 511-517.
26. KAUTZ, H., MCALLESTER, D., AND SELMAN, B. 1994. Encoding plans in propositional logic. In Proceedings of KR 94. 374-384.
27. KAUTZ, H. AND SELMAN, B. 1992. Planning as satisfiability. In Proceedings of ECAI-92. 359-363.
28. KAUTZ, H. AND SELMAN, B. 1996. Pushing the envelope: Planning, prepositional logic, and stochastic search. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96). AAAI Press, 1194-1199.
29. KAUTZ, H. AND SELMAN, B. 1998a. BLACKBOX: A new approach to the application of theorem proving to problem solving. In Workshop Planning as Combinatorial Search, AIPS-98 (Pittsburgh, PA).
30. KAUTZ, H. AND SELMAN, B. 1998b. The role of domain-specific knowledge in the planning as satis-fiability framework. In Proceedings of the 4th International Conference on Artificial Intelligence Planning and Scheduling Systems.
31. LEVESQUE, H., REITER, R., LESPERANCE, Y., LIN, F., AND SCHEEL, R. 1997. GOLOG: A logic programming language for dynamic domains. J. Logic Prog. 31, 1-3 (April-June), 59-84.
32. LIFSCHITZ, V. 1999a. Action languages, answer sets and planning. In The Logic Programming Paradigm: a 25-Year Perspective. Springer-Verlag, New York, 357-373.
33. LIFSCHITZ, V. 1999b. Answer set planning. In Proceedings of ICLP. 23-37.
34. LIFSCHITZ, V. 2002. Answer set programming and plan generation. Artif. Intel. 138, 1-2, 39-54.
35. LIFSCHITZ, V. AND TURNER, H. 1994. Splitting a logic program. In Proceedings of the 11th International Conference on Logic Programming, P. Van Hentenryck, Ed. 23-38.
36. LIFSCHITZ, V. AND TURNER, H. 1999. Representing transition systems by logic programs. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning. 92-106.
37. LIN, F. 1995. Embracing causality in specifying the indirect effects of actions. In Proceedings of the 14th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Mateo, CA, 1985-1993.
38. LIN, F. AND ZHAO, Y. 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. In AAAI.
39. MAREK, V. AND TRUSZCZYŃSKI, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-year Perspective. 375-398.
40. MCCAIN, N. AND TURNER, H. 1995. A causal theory of ramifications and qualifications. In Proceedings of the 14th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Mateo, CA, 1978-1984.
41. MCILRAITH, S. 2000. Modeling and programming devices and Web agents. In Proceedings of the NASA Goddard Workshop on Formal Approaches to Agent-Based Systems. Lecture Notes in Computer Science, vol. 1871. Springer-Verlag, New York.
42. NAU, D., CAO, Y., LOTEM, A., AND MUN̄OZ-AVILA, H. 1999. SHOP: Simple Hierarchical Ordered Planner. In Proceedings of the 16th International Conference on Artificial Intelligence. AAAI Press, Philadelphia, PA, 968-973.
43. NIEMELÄ, I. 1999. Logic programming with stable model semantics as a constraint programming paradigm. Ann. Mathe. Artif. Intel. 25, 3,4, 241-273.
44. NIEMELA, I., SIMONS, P., AND SOININEN, T. 1999. Stable model semantics for weight constraint rules. In Proceedings of the 5th International Conference on on Logic Programming and Nonmonotonic Reasoning. 315-332.
45. REITER, R. 1980. A logic for default reasoning. Artif. Intel. 13, 1,2, 81-132.
46. REITER, R. 2000. On knowledge-based programming with sensing in the situation calculus. In Proceedings of the 2nd International Cognitive Robotics Workshop (Berlin, Germany).
47. SACERDOTI, E. D. 1974. Planning in a hierarchy of abstraction spaces. Artif. Intel. 5, 115-135.
48. SAGONAS, K., SWIFT, T., AND WARREN, D. 1994. XSB as an efficient deductive database engine. In Proceedings of the SIGMOD. ACM, New York, 442-453.
49. SIMONS, P., NIEMELA, N., AND SOININEN, T. 2002. Extending and Implementing the Stable Model Semantics. Artif. Intel. 138, 1-2, 181-234.
50. SUBRAHMANIAN, V. AND ZANIOLO, C. 1995. Relating stable models and ai planning domains. In Proceedings of the International Conference on Logic Programming. 233-247.
51. TUAN, L. AND BARAL, C. 2001. Effect of knowledge representation on model based planning: Experiments using logic programming encodings. In Proc. of AAAI Spring symposium on "Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning", 110-115.
52. TURNER, H. 1997. Representing actions in logic programs and default theories. J. Logic Prog. 31, 1-3, 245-298.
53. TURNER, H. 2002. Polynomial-length planning spans the polynomial hierarchy. In Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA02), pp. 111-124.
54. WILKINS, D. AND DESJARDINES, M. Spring 2001. A call for knowledge-based planning. AI Magazine 22, 1, 99-115.