Summary
This is a discussion of some of the achievements and challenges related to representing actions and the design of planners from the perspective of logic programming. We talk about recent work on action languages and translating them into logic programming, on representing possible histories of an action domain by answer sets, on efficient implementations of the answer set semantics and their use for generating plans, and on causal logic and its relation to planning algorithms. Recent progress in these areas may lead to the creation of planners which are based on the ideas of logic programming and combine the use of expressive action description languages with efficient computational procedures.
This is a preview of subscription content, log in via an institution to check access.
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
Pawel Cholewińiski, Victor Marek, and Miroslaw Truszczyński. Default reasoning system DeReS. In Principles of Knowledge Representation and Reasoning: Proc. of the Fifth Int’l Conference, pages 518–528, 1996.
Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.
Mark Denecker and Danny De Schreye. Representing incomplete knowledge in abductive logic programming. In Dale Miller, editor, Logic Programming: Proceedings of the 1993 Int’l Symposium, pages 147–163, 1993.
Yannis Dimopoulos, Bernhard Nebel, and Jana Koehler. Encoding planning problems in non-monotonic logic programs. In Proc. ECP–97, 1997.
Phan Minh Dung. Representing actions in logic programming and its applications in database updates. In Logic Programming: Proceedings of the Tenth Int’l Conf. on Logic Programming, pages 222–238, 1993.
Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, and Francesco Scarcello. The kr system DLV: Progress report, comparisons and benchmarks. In Anthony Cohn, Lenhart Schubert, and Stuart Shapiro, editors, Proc. Sixth Int’l Conf on Principles of Knowledge Representation and Reasoning, pages 406–417, 1998.
Hector Geffner. Causal theories for nonmonotonic reasoning. In Proc. AAAI- 90, pages 524–530, 1990.
Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.
Michael Gelfond and Vladimir Lifschitz. Representing action and change by logic programs. Journal of Logic Programming, 17:301–322, 1993.
Enrico Giunchiglia and Vladimir Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. AAAI-98, pages 623–630, 1998.
Cordell Green. Application of theorem proving to problem solving. In Proc. IJCAI, pages 219–240, 1969.
Steve Hanks and Drew McDermott. Nonmonotonic logic and temporal projection. Artificial Intelligence, 33(3):379–412, 1987.
Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI-92, pages 359–363, 1992.
Henry Kautz and Bart Selman. Pushing the envelope: planning, propositional logic and stochastic search. In Proc. AAAI-96, pages 1194–1201, 1996.
Vladimir Lifschitz. Foundations of logic programming. In Gerhard Brewka, editor, Principles of Knowledge Representation, pages 69–128. CSLI Publications, 1996.
Vladimir Lifschitz. On the logic of causal explanation. Artificial Intelligence, 96:451–465, 1997.
Fangzhen Lin. Embracing causality in specifying the indirect effects of actions. In Proc. IJCAI-95, pages 1985–1991, 1995.
Victor Marek and Miroslaw Truszczyński. Stable models and an alternative logic programming paradigm, this volume, pp. 375–398.
Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. AAAI-97, pages 460–465, 1997.
Norman McCain and Hudson Turner. Satisfiability planning with causal theories. In Anthony Cohn, Lenhart Schubert, and Stuart Shapiro, editors, Proc. Sixth Int’l Conf. on Principles of Knowledge Representation and Reasoning, pages 212–223, 1998.
John McCarthy. Programs with common sense. In Proc. Teddington Conference on the Mechanization of Thought Processes, pages 75–91, London, 1959. Her Majesty’s Stationery Office. Reproduced in [22].
John McCarthy. Formalizing Common Sense: Papers by John McCarthy. Ablex, Norwood, NJ, 1990.
Ilkka Niemelä and Patrik Simons. Efficient implementation of the well-founded and stable model semantics. In Proc. Joint Int’l Conf. and Symp. on Logic Programming, pages 289–303, 1996.
Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.
Patrik Simons . Towards constraint satisfaction through logic programs and the stable model semantics. Technical Report 47, Helsinki University of Technology, 1997.
V.S. Subrahmanian and Carlo Zaniolo. Relating stable models and AI planning domains. In Proc. ICLP-95, pp. 233–247, MIT Press, 1995.
Hudson Turner. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming, 31:245–298, 1997.
Hudson Turner. A logic of universal causation. Artificial Intelligence. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lifschitz, V. (1999). Action Languages, Answer Sets, and Planning . In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds) The Logic Programming Paradigm. Artificial Intelligence. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60085-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-60085-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64249-4
Online ISBN: 978-3-642-60085-2
eBook Packages: Springer Book Archive