Abstract
In [1] a method for inducing the effects of actions was introduced which provides a solution to the frame problem in induction. The method relied on well-known monotonic methods of ILP making it as efficient as induction of Horn Logic Programs. That proposal is not intended for the induction of the ramifications of the effects of actions (indirect effects) thus providing domain descriptions with the so-called ramification problem. In this work we introduce the induction of such ramification rules describing effects directly from other effects without mentioning the action. A framework based on causality in action formalisms is used to induce causal ramification rules. The method is shown sound and complete while efficient as the induction of action rules.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Otero, R.: Induction of the effects of actions by monotonic methods. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 299–310. Springer, Heidelberg (2003)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming: Proc. of the Fifth Int’l Conf. and Symp., pp. 1070–1080 (1988)
Lifschitz, V.: Action languages, answers sets and planning. Artificial Intelligence 13, 245–286 (1995)
Lin, F.: Embracing causality in specifying the indirect effects of actions. In: Proc. of the 14th International Joint Conference on Artificial Intelligence, IJCAI 1995, pp. 1985–1991 (1995)
Otero, R.P.: Pertinence logic for reasoning about actions and change. Technical Report TR-AI-97-03, AILab, University of Corunna, Galicia, Spain (1997)
Otero, R.: Induction of stable models. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 193–205. Springer, Heidelberg (2001)
Muggleton, S., Feng, C.: Efficient induction of logic programs. Inductive Logic Programming (1992)
Kietz, J.: Some lower bounds on the computational complexity of inductive logic programming. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 115–123. Springer, Heidelberg (1993)
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
Otero, R.P. (2005). Induction of the Indirect Effects of Actions by Monotonic Methods. In: Kramer, S., Pfahringer, B. (eds) Inductive Logic Programming. ILP 2005. Lecture Notes in Computer Science(), vol 3625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11536314_17
Download citation
DOI: https://doi.org/10.1007/11536314_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28177-1
Online ISBN: 978-3-540-31851-4
eBook Packages: Computer ScienceComputer Science (R0)