Abstract
Answer set programming [8] 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. Answer set programming 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 [4], [5]. 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 [6], [7],[10] allows 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.
In the second stage of the programming process, a programming task is reduced to finding the answer sets of a logic program Π ∪ R where R is normally a simple and short program corresponding to this task. The answer sets are found with the help of programming systems [9],[2], [3] implementing various answer set finding algorithms.
During the last few years the answer set programming paradigm seems to have crossed the boundaries of artificial intelligence and has started to attract people in various areas of computer science.
In this talk I will briefly describe the basic idea of the approach and outline its use for the development of the USA-Advisor decision support system for the Space Shuttle. The largest part of this work was done by my former and current students Monica Nogueira, Marcello Balduccini, and Dr. Richard Watson, in close cooperation with Dr. Matt Barry from the USA Advanced Technology Development Group [1]. Our goals in creating the USA-Advisor were two-fold. From a scientific standpoint we wanted to test if the rapidly developing answer set programming methodologies, algorithms, and systems could be successfully applied to the creation of medium size, knowledge intensive applications. From the standpoint of engineering, the goal was to design a system to help flight controllers plan for correct operation of the shuttle in situations where multiple failures have occurred. Even though the engineering part of the project is not yet fully completed it is clear that the approach proved to be successful. In this talk I’ll share some lessons and observations learned from this work.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Balduccini, M. Barry, M. Gelfond, M. Nogueira, and R. Watson An A-Prolog decision support system for the Space Shuttle. Lecture Notes in Computer Science-Proceedings of Practical Aspects of Declarative Languages’01, (2001), 1990:169–183
S. Citrigno, T. Eiter, W. Faber, G. Gottlob, C. Koch, N. Leone, C. Mateis, G. Pfeifer and F. Scarcello. The dlv system: Model generator and application frontends. In Proceedings of the 12th Workshop on Logic Programming, 128–137, 1997.
P. Cholewinski, W. Maxek and M. Truszczyński. Default Reasoning System DeReS. In International Conference on Principles of Knowledge Representation and Reasoning, 518–528. Morgan Kauffman, 1996.
M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programs. In Proceedings of the 5th International Conference on Logic Programming, 1070–1080, 1988.
M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9(3/4):365–386, 1991.
M. Gelfond and V. Lifschitz. Representing Actions and Change by Logic Programs. Journal of Logic Programming, 17:301–323, 1993.
N. McCain and H. Turner. Causal theories of action and change. In 14th National Conference of Artificial Intelligence (AAAI’97), 460–465, 1997.
W. Marek, and M. Truszczyński. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, 375–398, Spring-Verlag. 1999.
I. Niemelä, and P. Simons. 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, 420–429, 1997.
H. Turner. Representing actions in logic programs and default theories: A situation calculus approach. Journal of Logic Programming, Vol. 31, No. 1–3, 245–298, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gelfond, M. (2002). The USA-Advisor: A Case Study in Answer Set Programming. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_55
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive