Answer set planning under action costs

Journal of Artificial Intelligence Research

Volumn 19, Issue , 2003, Pages 25-71

  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

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

DECLARATIVE PLANNING SYSTEMS; LOGIC PROGRAMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1642458582     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1148     Document Type: Article

References (51)

1. Blum, A. L., & Furst, M. L. (1997). Fast Planning Through Planning Graph Analysis. Artificial Intelligence, 90, 281-300.
2. Bonet, B., & Geffner, H. (2000). Planning with Incomplete Information as Heuristic Search in Belief Space. In Chien, S., Kambhampati, S., & Knoblock, C. A. (Eds.), Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS'00), pp. 52-61, Breckenridge, Colorado, USA.
3. Bryant, R. E. (1986). Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8), 677-691.
4. Buccafurri, F., Leone, N., & Rullo, P. (1997). Strong and Weak Constraints in Disjunctive Datalog. In Dix, J., Furbach, U., & Nerode, A. (Eds.), Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'97), No. 1265 in Lecture Notes in AI (LNAI), pp. 2-17, Dagstuhl, Germany. Springer Verlag.
5. Buccafurri, F., Leone, N., & Rullo, P. (2000). Enhancing Disjunctive Datalog by Constraints. IEEE Transactions on Knowledge and Data Engineering, 12(5), 845-860.
6. Cimatti, A., & Roveri, M. (2000). Conformant Planning via Symbolic Model Checking. Journal of Artificial Intelligence Research, 13, 305-338.
7. Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001). Complexity and Expressive Power of Logic Programming. ACM Computing Surveys, 33(3), 374-425.
8. Dimopoulos, Y., Nebel, B., & Koehler, J. (1997). Encoding Planning Problems in Nonmonotonic Logic Programs. In Proceedings of the European Conference on Planning 1997 (ECP-97), pp. 169-181. Springer Verlag.
9. Eiter, T., Faber, W., Leone, N., & Pfeifer, G. (2000a). Declarative Problem-Solving Using the DLV System. In Minker, J. (Ed.), Logic-Based Artificial Intelligence, pp. 79-103. Kluwer Academic Publishers.
10. Eiter, T., Faber, W., Leone, N., Pfeifer, G., & Polleres, A. (2000b). Planning under Incomplete Knowledge. In Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Palamidessi, C., Pereira, L. M., Sagiv, Y., & Stuckey, P. J. (Eds.), Computational Logic - CL 2000, First International Conference, Proceedings, No. 1861 in Lecture Notes in AI (LNAI), pp. 807-821, London, UK. Springer Verlag.
11. Eiter, T., Faber, W., Leone, N., Pfeifer, G., & Polleres, A. (2002a). Answer Set Planning under Action Costs. In Flesca, S., Greco, S., Ianni, G., & Leone, N. (Eds.), Proceedings of the 8th European Conference on Artificial Intelligence (JELIA), No. 2424 in Lecture Notes in Computer Science, pp. 186-197.
12. Eiter, T., Faber, W., Leone, N., Pfeifer, G., & Polleres, A. (2002b). Answer Set Planning under Action Costs. Tech. rep. INFSYS RR-1843-02-13, Institut für Informationssysteme, Technische Universität Wien.
13. script K sign System. Artificial Intelligence, 144(1-2), 157-211.
14. Eiter, T., Faber, W., Leone, N., Pfeifer, G., & Polleres, A. (2003b). A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity. To appear in ACM Transactions on Computational Logic.
15. Ephrati, E., Pollack, M. E., & Mihlstein, M. (1996). A Cost-directed Planner: Preliminary Report. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pp. 1223-1228. AAAI Press.
16. Erdem, E. (1999). Applications of Logic Programming to Planning: Computational Experiments. Unpublished draft, http://www.cs.utexas.edu/users/ esra/papers.html.
17. Faber, W., & Pfeifer, G. (since 1996). DLV homepage.. http://www.dlvsystem.com/.
18. Ferraris, P., & Giunchiglia, E. (2000). Planning as Satisfiability in Nondeterministic Domains. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI'00), July 30 - August 3, 2000, Austin, Texas USA, pp. 748-753. AAAI Press / The MIT Press.
19. Fourer, R., Gay, D. M., & Kernighan, B. W. (1993). AMPL: A Modeling Language for Mathematical Programming. Duxbury Press.
20. Gelfond, M., & Lifschitz, V. (1991). Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9, 365-385.
21. Ghallab, M., Howe, A., Knoblock, C., McDermott, D., Ram, A., Veloso, M., Weld, D., & Wilkins, D. (1998). PDDL - The Planning Domain Definition language. Tech. rep., Yale Center for Computational Vision and Control. Available at http://www.cs.yale.edu/pub/mcdermott/software/pddl.tar.gz.
22. Giunchiglia, E. (2000). Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism. In Cohn, A. G., Giunchiglia, F., & Selman, B. (Eds.), Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2000), April 12-15, Breckenridge, Colorado, USA, pp. 657-666. Morgan Kaufmann.
23. Giunchiglia, E., Kartha, G. N., & Lifschitz, V. (1997). Representing Action: Indeterminacy and Ramifications. Artificial Intelligence, 95, 409-443.
24. Giunchiglia, E., & Lifschitz, V. (1998). An Action Language Based on Causal Explanation: Preliminary Report. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI '98), pp. 623-630.
25. Haslum, P., & Geffner, H. (2000). Admissible Heuristics for Optimal Planning. In Chien, S., Kambhampati, S., & Knoblock, C. A. (Eds.), Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS'00), pp. 140-149, Breckenridge, Colorado, USA. AAAI Press.
26. Kautz, H., & Walser, J. P. (1999). State-space planning by integer optimization. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99), pp. 526-533.
27. Koehler, J. (1998). Planning Under Resource Constraints. In Proceedings of the 13th European Conference on Artificial Intelligence (ECAI'98), pp. 489-493.
28. Krentel, M. (1992). Generalizations of Opt P to the Polynomial Hierarchy. Theoretical Computer Science, 97(2), 183-198.
29. Lee, J., & Lifschitz, V. (2001). Additive Fluents. In Provetti, A., & Cao, S. T. (Eds.), Proceedings AAAI 2001 Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pp. 116-123, Stanford, CA. AAAI Press.
30. Lifschitz, V., & Turner, H. (1994). Splitting a Logic Program. In Van Hentenryck, P. (Ed.), Proceedings of the 11th International Conference on Logic Programming (ICLP'94), pp. 23-37, Santa Margherita Ligure, Italy. MIT Press.
31. Lifschitz, V., & Turner, H. (1999). Representing Transition Systems by Logic Programs. In Gelfond, M., Leone, N., & Pfeifer, G. (Eds.), Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), No. 1730 in Lecture Notes in AI (LNAI), pp. 92-106, El Paso, Texas, USA. Springer Verlag.
32. Lifschitz, V. (1996). Foundations of Logic Programming. In Brewka, G. (Ed.), Principles of Knowledge Representation, pp. 69-127. CSLI Publications, Stanford.
33. Lifschitz, V. (1999a). Action Languages, Answer Sets and Planning. In Apt, K., Marek, V. W., Truszczyński, M., & Warren, D. S. (Eds.), The Logic Programming Paradigm - A 25-Year Perspective, pp. 357-373. Springer Verlag.
34. Lifschitz, V. (1999b). Answer Set Planning. In Schreye, D. D. (Ed.), Proceedings of the 16th International Conference on Logic Programming (ICLP'99), pp. 23-37, Las Cruces, New Mexico, USA. The MIT Press.
35. McCain, N. (1999). The Causal Calculator Homepage., http://www.cs.utexas. edu/users/tag/cc/.
36. McCain, N., & Turner, H. (1997). Causal Theories of Actions and Change. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-97), pp. 460-465.
37. McCain, N., & Turner, H. (1998). Satisfiability Planning with Causal Theories. In Cohn, A. G., Schubert, L., & Shapiro, S. C. (Eds.), Proceedings Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pp. 212-223. Morgan Kaufmann Publishers.
38. Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, June 18-22, 2001, pp. 530-535. ACM.
39. Nareyek, A. (2001). Beyond the Plan-Length Criterion. In Local Search for Planning and Scheduling, ECAI 2000 Workshop, Vol. 2148 of Lecture Notes in Computer Science, pp. 55-78. Springer.
40. Niemelä, I. (1998). Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. In Niemelä, I., & Schaub, T. (Eds.), Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pp. 72-79, Trento, Italy.
41. Papadimitriou, C. H. (1994). Computational Complexity. Addison-Wesley.
42. Pednault, E. P. D. (1989). Exploring the Middle Ground between STRIPS and the Situation Calculus. In Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89), pp. 324-332, Toronto, Canada. Morgan Kaufmann Publishers, Inc.
43. Refanidis, I., & Vlahavas, I. (2001). A Framework for Multi-Criteria Plan Evaluation in Heuristic State-Space Planning. In IJCAI-01 Workshop on Planning with Resources.
44. Selman, A. L. (1994). A Taxonomy of Complexity Classes of Functions. Journal of Computer and System Sciences, 48(2), 357-381.
45. Simons, P., Niemelä, I., & Soininen, T. (2002). Extending and Implementing the Stable Model Semantics. Artificial Intelligence, 138, 181-234.
46. Smith, D. E., & Weld, D. S. (1998). Conformant Graphplan. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, (AAAI'98), pp. 889-896. AAAI Press / The MIT Press.
47. Son, T. C., & Pontelli, E. (2002). Reasoning About Actions in Prioritized Default Theory. In Flesca, S., Greco, S., Ianni, G., & Leone, N. (Eds.), Proceedings of the 8th European Conference on Artificial Intelligence (JELIA), No. 2424 in Lecture Notes in Computer Science, pp. 369-381.
48. th International Conference on Logic Programming, pp. 233-247, Tokyo, Japan. MIT Press.
49. van Gelder, A., Ross, K., & Schlipf, J. (1991). The Well-Founded Semantics for General Logic Programs. Journal of the ACM, 38(3), 620-650.
50. Weld, D. S., Anderson, C. R., & Smith, D. E. (1998). Extending Graphplan to Handle Uncertainty & Sensing Actions. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, (AAAI'98), pp. 897-904. AAAI Press / The MIT Press.
51. Williams, M., & Hanks, S. (1994). Optimal Planning with a Goal-Directed Utility Model. In Hammond, K. J. (Ed.), Proceedings of the Second International Conference on Artificial Intelligence Planning Systems (AIPS-94), pp. 176-181. AAAI Press.