Abstract
We describe \(\mathcal{M}\)odular-ε (\(\mathcal{ME}\)), a specialized, model-theoretic logic for narrative reasoning about actions, able to represent non-deterministic domains involving concurrency, static laws (constraints) and indirect effects (ramifications). We give formal results which characterize \(\mathcal{ME}\)’s high degree of modularity and elaboration tolerance, and show how these properties help to separate out, and provide a principled solutions to, the endogenous and exogenous qualification problems. We also show how a notion of (micro) processes can be used to facilitate reasoning at the dual levels of temporal granularity necessary for narrative-based domains involving “instantaneous” series of indirect and knock-on effects.
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
Denecker, M., Theseider-Dupré, D., Van Belleghem, K.: An inductive definition approach to ramifications. Linkoping Electronic Articles in Computer and Information Science 3(7), 1–43 (1998)
Dimopoulos, Y., Kakas, A., Michael, L.: Reasoning about actions and change in answer set programming. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 61–73. Springer, Heidelberg (2003)
Elkan, C.: On solving the qualification problem. In: Extending Theories of Actions: Formal theory and practical applications, AAAI Spring Symposium (1995)
Ginsberg, M., Smith, D.: Reasoning about Action II: The Qualification Problem. AIJ 35 (1988)
Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic Causal Theories. AIJ 153(1–2), 49–104 (2004)
Herzig, A., Varzinczak, I.: Domain Descriptions Should be Modular. In: Proceedings of ECAI 2004. IOS Press, Amsterdam (2004)
Kakas, A., Miller, R.: Reasoning about Actions, Narratives and Ramifications. Journal of Electronic Transactions on AI 1(4) (1998)
Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: Proceedings of NCAI 1996 (1996)
Lifschitz, V.: Missionaries and cannibals in the causal calculator. In: Proceedings of KR 2000 (2000)
McCarthy, J.: Elaboration tolerance (1999), http://www-formal.stanford.edy/jmc/elaboration
Miller, R., Shanahan, M.: Some Alternative Formulations of the Event Calculus. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 452–490. Springer, Heidelberg (2002)
Shanahan, M., Witkowski, M.: Event Calculus Planning Through Satisfiability. J. of Logic Comp. 14(5), 731–745 (2004)
Thielscher, M.: The Qualification Problem: A solution to the problem of anomalous models. AIJ 131(1–2), 1–37 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kakas, A., Michael, L., Miller, R. (2005). \(\mathcal{M}\)odular-ε: An Elaboration Tolerant Approach to the Ramification and Qualification Problems. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2005. Lecture Notes in Computer Science(), vol 3662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546207_17
Download citation
DOI: https://doi.org/10.1007/11546207_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28538-0
Online ISBN: 978-3-540-31827-9
eBook Packages: Computer ScienceComputer Science (R0)