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.

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.

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¨ur Informationssysteme, Technische Universit¨at Wien.

Eiter, T., Faber, W., Leone, N., Pfeifer, G., & Polleres, A. (2003a). A Logic Programming Approach to Knowledge-State Planning, II: the DLVK System. Artificial Intelligence, 144(1–2), 157–
211.

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.

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.

Erdem, E. (1999). Applications of Logic Programming to Planning: Computational Experiments.

Unpublished draft. http://www.cs.utexas.edu/users/esra/papers.html.

Faber, W., & Pfeifer, G. (since 1996). DLV homepage.. http://www.dlvsystem.com/. 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.

Fourer, R., Gay, D. M., & Kernighan, B. W. (1993). *AMPL: A Modeling Language for Mathematical* Programming. Duxbury Press.

Gelfond, M., & Lifschitz, V. (1991). Classical Negation in Logic Programs and Disjunctive Databases. *New Generation Computing,* 9, 365–385.

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.

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.