Abstract
Action languages allow for a concise representation of actions and their effects while at the same time being easily readable and writable for humans. In this paper, we introduce \({\mathcal D}\), the first action language that centres around default reasoning about actions and change. It allows to specify normal Reiter-style defaults and provides a semantics that has at its core the groundedness of conclusions. This is not only of use for default conclusions, but also for \({\mathcal D}\)’s solution to the ramification problem. Additionally, our language does not suffer from Yale Shooting-like counterexamples since it uses different mechanisms for default persistence and default change. The answer set programming paradigm is used as the basis of \({\mathcal D}\)’s implementation, which we prove sound and complete with respect to the language’s semantics. We finally present a showcase application for the language: its straightforward solution to the qualification problem.
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
Gelfond, M., Lifschitz, V.: Representing Action and Change by Logic Programs. Journal of Logic Programming 17(2/3&4), 301–321 (1993)
Gelfond, M., Lifschitz, V.: Action Languages. Electronic Transactions on Artificial Intelligence 3 (1998)
Giunchiglia, E., Lifschitz, V.: An Action Language Based on Causal Explanation: Preliminary Report. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI 1998), pp. 623–630. American Association for Artificial Intelligence, Menlo Park (1998)
Kakas, A., Miller, R.: A Simple Declarative Language for Describing Narratives with Actions. Journal of Logic Programming 31(1–3), 157–200 (1997); Reasoning about Actions and Change
Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic Causal Theories. Artificial Intelligence 153(1-2), 49–104 (2004)
Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity. ACM Transactions on Computational Logic 5, 206–263 (2004)
McCarthy, J.: Epistemological Problems of Artificial Intelligence. In: Proceedings of the Fifth International Joint Conference on Artificial Intelligence (IJCAI 1977), pp. 1038–1044 (1977)
Reiter, R.: A Logic for Default Reasoning. Artificial Intelligence 13, 81–132 (1980)
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)
Gelfond, M., Lifschitz, V., Rabinov, A.: What Are the Limitations of the Situation Calculus? In: Boyer, R.S., Pase, W. (eds.) Automated Reasoning. Automated Reasoning Series, vol. 1, pp. 167–179. Springer, Netherlands (1991)
Thielscher, M.: Causality and the Qualification Problem. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), Cambridge, MA, pp. 51–62 (November 1996)
Baumann, R., Brewka, G., Strass, H., Thielscher, M., Zaslawski, V.: State Defaults and Ramifications in the Unifying Action Calculus. In: Proceedings of the Twelfth International Conference on the Principles of Knowledge Representation and Reasoning, Toronto, Canada, pp. 435–444 (May 2010)
Mueller, E.: Commonsense Reasoning. Morgan Kaufmann (2006)
Lakemeyer, G., Levesque, H.: A Semantical Account of Progression in the Presence of Defaults. In: Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 842–847 (2009)
Michael, L., Kakas, A.: A Unified Argumentation-Based Framework for Knowledge Qualification. In: Davis, E., Doherty, P., Erdem, E. (eds.) Proceedings Commonsense, Stanford, CA (March 2011)
Britz, K., Meyer, T., Varzinczak, I.: Preferential Reasoning for Modal Logics. Electronic Notes in Theoretical Computer Science 278, 55–69 (2011)
Kim, T.W., Lee, J., Palla, R.: Circumscriptive Event Calculus as Answer Set Programming. In: IJCAI, pp. 823–829 (July 2009)
Lee, J., Palla, R.: Situation Calculus as Answer Set Programming. In: Proceedings of the Twenty-Fourth Conference on Artificial Intelligence (AAAI 2010), pp. 309–314 (July 2010)
Casolary, M., Lee, J.: Representing the Language of the Causal Calculator in Answer Set Programming. In: Proceedings of the Twenty-Seventh International Conference on Logic Programming (ICLP 2011) (July 2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Strass, H., Thielscher, M. (2012). A Language for Default Reasoning about Actions. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds) Correct Reasoning. Lecture Notes in Computer Science, vol 7265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30743-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-30743-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30742-3
Online ISBN: 978-3-642-30743-0
eBook Packages: Computer ScienceComputer Science (R0)