Abstract
Answer set programming (ASP) (see, for instance, [22]) is a new declarative programming paradigm suitable for solving a large range of problems related to knowledge representation and search. The paradigm is rooted in recent developments in several areas of artificial intelligence. ASP starts by encoding relevant domain knowledge as a (possibly disjunctive) logic program, Π. The connectives of this program are normally understood in accordance with the answer set (stable model) semantics [12,13]. The corresponding language is frequently referred to as A-Prolog (or ANS-Prolog). The language’s ability to express defaults, i.e. statements of the form “normally, objects of class C have property P”, coupled with its natural treatment of recursion, and other useful features, often leads to a comparatively concise and clear representation of knowledge. Insights on the nature of causality and its relationship with the answer sets of logic programs [14,21,25] allows for the description of the effects of actions which solves the frame, ramification, and qualification problems, which for a long time have caused difficulties in modeling knowledge about dynamic domains.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balduccini, M., Barry, M., Gelfond, M., Nogueira, M., Watson, R.: An A-Prolog decision support system for the Space Shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001)
Balduccini, M., Gelfond, M., Nogueira, M., Watson, R.: Planning with the USA-Advisor. In: 3rd International NASA Workshop on Planning and Scheduling for Space (September 2002)
Balduccini, M., Gelfond, M.: Diagnostic reasoning with A-Prolog. Theory and Practice of Logic Programming 3(4-5), 425–461 (2003)
Balduccini, M., Mellarkod, V.: A-Prolog with CR-Rules and Ordered Disjunction. In: ICISIP 2004, January 2004, pp. 1-6 (2004)
Balduccini, M.: USA-Smart: Improving the Quality of Plans in Answer Set Planning. In: Jayaraman, B. (ed.) PADL 2004. LNCS, vol. 3057, pp. 135–147. Springer, Heidelberg (2004)
Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge (2003)
Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. In: The Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 21–33 (2004)
Baral, C., Gelfond, M.: Reasoning agents in dynamic domains. In: Minker, J. (ed.) Logic Based AI, pp. 257–279. Kluwer, Dordrecht (2000)
Citrigno, S., Eiter, T., Faber, W., Gottlob, G., Koch, C., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The dlv system: Model generator and application frontends. In: Proceedings of the 12th Workshop on Logic Programming, pp. 128–137 (1997)
Cholewinski, P., Marek, W., Truszczyński, M.: Default Reasoning System DeReS. In: International Conference on Principles of Knowledge Representation and Reasoning, pp. 518–528. Morgan Kauffman, San Francisco (1996)
Dimopoulos, Y., Nebel, B., Koehler, J.: Encoding planning problems in nonmonotonic logic programs. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 169–180. Springer, Heidelberg (1997)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programs. In: Proceedings of the 5th International Conference on Logic Programming, pp. 1070–1080 (1988)
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9(3/4), 365–386 (1991)
Gelfond, M., Lifschitz, V.: Representing Actions and Change by Logic Programs. Journal of Logic Programming 17, 301–323 (1993)
Kautz, H., Selman, B.: Planning as Satisfiability. In: Proc. of ECAI 1992, pp. 359–363 (1992)
Lierler, Y., Maratea, M.: Cmodels-2: SAT-based Answer Sets Solver Enhanced to Non-tight Programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346–350. Springer, Heidelberg (2003)
Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138, 39–54 (2002)
Lifschitz, V., Turner, H.: Representing transition systems by logic programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 92–106. Springer, Heidelberg (1999)
Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic (to appear)
Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of A Logic Program By SAT Solvers. In: Proc. of AAAI 2002, pp. 112–117 (2002)
McCain, N., Turner, H.: Causal theories of action and change. In: 14th National Conference of Artificial Intelligence (AAAI 1997), pp. 460–465 (1997)
Marek, W., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398. Spring-Verlag (1999)
Niemelä, I., Simons, P.: Smodels – an implementation of the stable model and well-founded semantics for normal logic programs. In: Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pp. 420–429 (1997)
Nogueira, M.: Building Knowledge Systems in A-Prolog. PhD thesis, University of Texas at El Paso (May 2003)
Turner, H.: Representing actions in logic programs and default theories: A situation calculus approach. Journal of Logic Programming 31(1-3), 245–298 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gelfond, M. (2004). Answer Set Programming and the Design of Deliberative Agents. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive