A logic programming approach to knowledge-state planning: Semantics and complexity

ACM Transactions on Computational Logic

Volumn 5, Issue 2, 2004, Pages 206-263

  Eiter, Thomas ^a   Faber, Wolfgang ^a   Leone, Nicola ^b   Pfeifer, Gerald ^a   Polleres, Axel ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Answer sets; Computational complexity; Conformant planning; Declarative planning; Incomplete information; Knowledge states; Secure planning

Indexed keywords

ANSWER SETS; CONFORMANT PLANNING; INCOMPLETE INFORMATION; KNOWLEDGE-STATES; SECURE PLANNING;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; LARGE SCALE SYSTEMS; SEMANTICS; SENSITIVITY ANALYSIS;

LOGIC PROGRAMMING;

EID: 4444318232     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/976706.976708     Document Type: Article

References (76)

1. BARAL, C., KREINOVICH, V., AND TREJO, R. 2000. Computational complexity of planning and approximate planning in the presence of incompleteness. Artif. Intel. 122, 1-2, 241-267.
2. BAYARDO, R. AND SCHRAG, R. 1997. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-97). 203-208.
3. BYLANDER, T. 1994. The computational complexity of propositional STRIPS planning. Artif. Intel. 69, 165-204.
4. CADOLI, M., GIOVANARDI, A., AND SCHAERF, M. 1998. An algorithm to evaluate quantified Boolean formulae. In Proceedings of the AAAI/IAAI-98. 262-267.
5. CIMATTI, A. AND RovERI, M. 1999. Conformant planning via model checking. In Proceedings of the 5th European Conference on Planning (ECP'99). 21-34.
6. CIMATTI, A. AND ROVERI, M. 2000. Conformant planning via symbolic model checking. J. Artif. Intel. Res. 13, 305-338.
7. DANTSIN, E., EITER, T., GOTTLOB, G., AND VORONKOV, A. 1997. Complexity and expressive power of logic programming. In Proceedings of the 12th Annual IEEE conference on Computational Complexity (CCC'97). (Ulm, Germany, June 24-27). Computer Society Press, 82-101. (Extended paper in ACM Computing Surveys, 33(3), September 2001.)
8. DIMOPOULOS, Y., NEBEL, B., AND KOEHLER, J. 1997. Encoding planning problems in nonmonotonic logic programs. In Proceedings of the European Conference on Planning 1997 (ECP-97). Springer-Verlag, New York, 169-181.
9. DIX, J. 1995. Semantics of logic programs: Their intuitions and formal properties. An overview. In Logic, Action and Information. Proceedings of the Konstanz Colloquium in Logic and Information (LogIn'92). DeGruyter, 241-329.
10. DUNG, P. M. 1992. On the relations between stable and well-founded semantics of logic programs. Theoret. Comput. Sci. 105, 1, 7-25.
11. EITER, T., FABER, W., LEONE, N., PFEIFER, G., AND POLLERES, A. 2000. Planning under incomplete knowledge. In Computational Logic - CL 2000, First International Conference, Proceedings, (London, U.K.). J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, and P. J. Stuckey, Eds. Lecture Notes in Artificial Intelligence, vol. 1861. Springer-Verlag, New York, 807-821.
12. k System. Tech. Rep. INFSYS RR-1843-01-12, Institut für Informationssysteme, Technische Universität Wien. Dec.
13. 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 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), A. G. Cohn, L. Schubert, and S. C. Shapiro, Eds. Morgan-Kaufmann, San Mateo, Calif., 406-417.
14. EROL, K., NAU, D. S., AND SUBRAHMANIAN, V. 2000. Complexity, decidability and undecidability results for domain-independent planning. Artif. Intel. 76, 1-2 (July), 75-88.
15. ESHOHI, K. 1988. Abductive planning with event calculus. In Proceedings of the 5th International Conference and Symposium on Logic Programming. MIT Press, 562-579.
16. FABER, W., LEONE, N., AND PFEIFER, G. 1999. Pushing goal derivation in dip computations. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99) (El Paso, Tex.). M. Gelfond, N. Leone, and G. Pfeifer, Eds. Lecture Notes in Artificial Intelligence, vol. 1730. Springer-Verlag, New York, 177-191.
17. PAGES, F. 1994. Consistency of Clark's completion and existence of stable models. J. Meth. Logic Comput. Sci. 1, 1, 51-60.
18. FELDMANN, R., MONIEN, B., AND SCHAMBERGER, S. 2000. A distributed algorithm to evaluate quantified Boolean formulae. In Proceedings of the National Conference on AI (AAAI'00) (Austin, Tex., July 30-Aug. 3). AAAI Press/The MIT Press, 285-290.
19. FERRARIS, P. AND GIUNCHIGLIA, E. 2000. Planning as satisfiability in nondeterministic domains. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI'00), (Austin, Tex., July 30-Aug. 3). AAAI Press/The MIT Press, 748-753.
20. FIKES, R. E. AND NILSSON, N. J. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artif. Intel. 2, 3-4, 189-208.
21. FINZI, A., PIRRI, F., AND REITER, R. 2000. Open world planning in the situation calculus. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI'00), (Austin, Tex., July 30-Aug. 3). AAAI Press/The MIT Press, 754-760.
22. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Gen. Comput. 9, 365-385.
23. GELFOND, M. AND LIFSCHITZ, V. 1993. Representing action and change by logic programs. J. Logic Prog. 17, 301-321.
24. GELFOND, M. AND LIFSCHITZ, V. 1998. Action languages. Elect. Trans. Artif. Intel. 2, 3-4, 193-210.
25. GIUNCHIGLIA, E. 2000. Planning as satisfiability with expressive action languages: Concurrency, constraints and nondeterminism. In Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning (KR 2000), (Breckenridge, Colo., Apr. 12-15). A. G. Cohn, F. Giunchiglia, and B. Selman, Eds. Morgan-Kaufmann, San Mateo, Calif., 657-666.
26. GIUNCHIGLIA, E., KARTHA, G. N., AND LIFSCHITZ, V. 1997. Representing action: Indeterminacy and ramifications. Artif. Intel. 95, 409-443.
27. GIUNCHIGLIA, E., LEE, J., LIFSCHITZ, V., AND TURNER, H. 2001. Causal laws and multi-valued fluents. In Working Notes of the 4th Workshop on Nonmonotonic Reasoning, Action and Change.
28. GIUNCHIGLIA, E. AND LIFSCHITZ, V. 1998. An action language based on causal explanation: Preliminary report. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI '98). 623-630.
29. GIUNCHIGLIA, E. AND LIFSCHITZ, V. 1999. Action languages, temporal action logics and the situation calculus. In Working Notes of the IJCAI'99 Workshop on Nonmonotonic Reasoning, Action, and Change.
30. GOLDMAN, R. AND BODDY, M. 1996. Expressive planning and explicit knowledge. In Proceedings of AIPS-96. AAAI Press, 110-117.
31. GOTTLOB, G., LEONE, N., AND VEITH, H. 1999. Succinctness as a source of expression complexity. Ann. Pure Appl. Logic 97, 1-3, 231-260.
32. GREEN, C. C. 1969. Application of theorem proving to problem solving. In Proceedings of IJCAI '69. 219-240.
33. HANKS, S. AND MCDERMOTT, D. 1987. Nonmonotonic logic and temporal projection. Artif. Intel. 33, 3, 379-412.
34. IOCCHI, L., NARDI, D., AND ROSATI, R. 2000. Planning with sensing, concurrency, and exogenous events: Logical framework and implementation. In Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning (KR 2000) (Breckenridge, Colo., Apr. 12-15). A. G. Cohn, F. Giunchiglia, and B. Selman, Eds. Morgan-Kaufmann San Mateo, Calif., 678-689.
35. KARTHA, G. N. AND LIFSCHITZ, V. 1994. Actions with indirect effects (preliminary report). In Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR 94). 341-350.
36. KAUTZ, H. AND SELMAN, B. 1992. Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI '92). 359-363.
37. KAUTZ, H. AND SELMAN, B. 1999. Unifying sat-based and graph-based planning. In The International Joint Conferences on Artificial Intelligence (IJCAI) 1999. Stockholm, Sweden, 318-325.
38. KOWALSKI, R. AND SERGOT, M. 1986. A logic-based calculus of events. New Gen. Comput. 4, 67-95.
39. KUSHMERICK, N., HANKS, S., AND WELD, D. S. 1995. An Algorithm for probabilistic planning. Artif. Intel. 76, 1-2, 239-286.
40. LEVESQUE, H. J., REITER, R., LESPÉRANCE, Y., LIN, F., AND SCHERL, R. B. 1997. GOLOG: A logic programming language for dynamic domains. J. Logic Prog. 31, 1-3, 59-83.
41. LI, C. AND ANBULAGAN. 1997. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI) 1997 (Nagoya, Japan). 366-371.
42. LIFSCHITZ, V. 1997. On the logic of causal explanation. Artif. Intel. 96, 451-465.
43. LIFSCHITZ, V. 1999a. Action languages, answer sets, and planning. In The Logic Programming Paradigm - A 25-Year Perspective, K. Apt, V. W. Marek, M. Truszczyński, and D. S. Warren, Eds. Springer-Verlag, New York, 357-373.
44. LIFSCHITZ, V. 1999b. Answer Set Planning. In Proceedings of the 16th International Conference on Logic Programming (ICLP99) (Las Cruces, N.M.). D. D. Schreye, Ed. The MIT Press, Cambridge, Mass., 23-37.
45. 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 (LPNMR'99) (El Paso, Tex.). M. Gelfond, N. Leone, and G. Pfeifer, Eds. Lecture Notes Artificial Intelligence, vol. 1730. Springer-Verlag, New York, 92-106.
46. MAREK, W. AND TRUSZCZYŃSKI, M. 1991. Autoepistemic logic. J. ACM 38, 3, 588-619.
47. MCCAIN, N. 1999. The clausal calculator homepage. 〈URL:http://www.es.utexas.edu/users/tag/cc/〉.
48. MCCAIN, N. AND TURNER, H. 1995. A Causal theory of ramifications and qualifications. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95). 1978-1984.
49. MCCAIN, N. AND TURNER, H. 1997. Causal theories of actions and change. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-97). 460-465.
50. MCCAIN, N. AND TURNER, H. 1998. Satisfiability planning with causal theories. In Proceedings Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), A. G. Cohn, L. Schubert, and S. C. Shapiro, Eds. Morgan-Kaufmann, San Mateo, Calif., 212-223.
51. MCCARTHY, J. AND HAYES, P. J. 1969. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence 4, B. Meltzer and D. Michie, Eds. Edinburgh University Press, 463-502.
52. MCDERMOTT, D. 1987. A critique of pure reason. Computat. Intel. 3, 151-237. (Cited in Cimatti and Roveri [2000].)
53. MOSKEWICZ, M. W., MADIGAN, C. F., ZHAO, Y., ZHANG, L., AND MALIK, S. 2001. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference, DAC 2001 (Las Vegas, Nev., June 18-22). ACM, New York, 530-535.
54. NIEMELÄ, I. 1999. Logic programming with stable model semantics as constraint programming paradigm. Ann. Math. Artif. Intel. 25, 3-4, 241-273.
55. PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison-Wesley, Reading, Mass.
56. PEOT, M. A. 1998. Decision-Theoretic Planning. Ph.D. dissertation, Stanford University, Stanford, Calif.
57. PEOT, M. A. AND SMITH, D. E. 1992. Conditional nonlinear planning. In Proceedings of the 1st International Conference on Artificial Intelligence Planning Systems. AAAI Press, 189-197.
58. K System for planning with incomplete knowledge. M.S. thesis. Institut für Informationssysteme, Technische Universität Wien, Wien, Österreich.
59. PRYOR, L. AND COLLINS, G. 1996. Planning for contingencies: A decision-based approach. J. Artif. Intel. Res. 4, 287-339.
60. REITER, R. 1978. On closed world data bases. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, 55-76.
61. RINTANEN, J. 1999a. Constructing conditional plans by a theorem-prover. J. Artif. Intel. Res. 10, 323-352.
62. RINTANEN, J. 1999b. Improvements to the evaluation of quantified Boolean formulae. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI) 1999 (Stockholm, Sweden). T. Dean, Ed. Morgan-Kaufmann, San Mateo, Calif., 1192-1197.
63. RUSSEL, S. J. AND NORVIG, P. 1995. Artificial Intelligence, A Modern Approach. Prentice-Hall, Inc., Englewood Cliffs, N.J.
64. SHANAHAN, M. 1989. Prediction is deduction but explanation is abduction. In Proceedings of IJCAI '89. 1055-1060.
65. SMITH, D. E. AND WELD, D. S. 1998. Conformant graphplan. In Proceedings of the 15th National Conference on Artificial Intelligence, (AAAI'98). AAAI Press / The MIT Press, 889-896.
66. SON, T. C. AND BARAL, C. 2001. Formalizing sensing actions - A transition function based approach. Artif. Intel. 125, 1-2, 19-91.
67. SUBRAHMANIAN, V. AND ZANIOLO, C. 1995. Relating stable models and AI planning domains. In Proceedings of the 12th International Conference on Logic Programming (Tokyo, Japan). L. Sterling, Ed. MIT Press, Cambridge, Mass., 233-247.
68. SUSSMAN, G. J. 1990. The virtuous nature of bugs. In Readings in Planning, J. Allen, J. Hendler, and A. Tate, Eds. Morgan-Kaufmann, San Mateo, Calif., Chap. 3, 111-117. (Originally written 1974).
69. TURNER, H. 1997. Representing actions in logic programs and default theories: A situation calculus approach. J. Logic Prog. 31, 1-3, 245-298.
70. TURNER, H. 1999. A logic of universal causation. Artif. Intel. 113, 87-123.
71. TURNER, H. 2002. Polynomial-length planning spans the polynomial hierarchy. In Proceedings of the 8th European Conference on Artificial Intelligence (JELIA), S. Flesca, S. Greco, G. Ianni, and N. Leone, Eds. Lecture Notes in Computer Science, vol. 2424. Springer-Verlag, New York, 111-124.
72. ULLMAN, J. D. 1989. Principles of Database and Knowledge Base Systems. Vol. 1. Computer Science Press.
73. VELOSO, M. 1989. Nonlinear problem solving using intelligent causal-commitment. Tech. Rep. CMU-CS-89-210, Carnegie Mellon Univ., Pittsburgh, Pa.
74. WELD, D. S. 1994. An introduction to least commitment planning. AI Mag. 15, 4, 27-61.
75. WELD, D. S. 1999. Recent advances in AI planning. AI Mag. 20, 2, 93-123.
76. ZHANG, H. 1997. SATO: An efficient propositional prover. In Proceedings of the International Conference on Automated Deduction (CADE'1997). 272-275.