Abstract
We propose a novel method for efficient θ-subsumption. Our solution is based on the idea of object context which embody the contextual information in a clause and is given by occurrences of identical objects or chains of such occurrences. Efficient θ-subsumption is crucial for AI planning approaches that rely on lifted first-order reasoning. We incorporate our object context-based method for θ-subsumption within one approach for lifted first-order planning under uncertainty, referred to as LIFT-UP, and compare it with several related techniques.
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
Boutilier, C., Dean, T., Hanks, S.: Decision-theoretic planning: Structural assumptions and computational leverage. JAIR 11, 1–94 (1999)
Barto, A.G., Bradtke, S.J., Singh, S.P.: Learning to act using real-time dynamic programming. AI 72(1-2), 81–138 (1995)
Feng, Z., Hansen, E.: Symbolic heuristic search for factored Markov Decision Processes. In: AAAI (2002)
Hoey, J., St-Aubin, R., Hu, A., Boutilier, C.: SPUDD: Stochastic Planning using Decision Diagrams. In: UAI (1999)
Hölldobler, S., Karabaev, E., Skvortsova, O.: FluCaP: A heuristic search planner for first-order MDPs. JAIR 2006 (to appear)
Hölldobler, S., Skvortsova, O.: LIFT-UP: Lifted first-order planning under uncetainty. In: IWIL 2006 (to appear)
Kapur, D., Narendran, P.: NP-completeness of the set unification and matching problems. In: Siekmann, J.H. (ed.) 8th International Conference on Automated Deduction. LNCS, vol. 230, Springer, Heidelberg (1986)
Kietz, J.-U., Lübbe, M.: An efficient subsumption algorithm for inductive logic programming. In: ICML (1994)
Maloberti, J., Sebag, M.: Fast theta-subsumption with constraint satisfaction algorithms. ML 55(2) (2004)
Scheffer, T., Herbrich, R., Wysotzki, F.: Efficient θ-subsumption based on graph algorithms. In: Inductive Logic Programming. LNCS, vol. 1314, Springer, Heidelberg (1997)
Karabaev, E., Rammé, G., Skvortsova, O.: Efficient symbolic reasoning for first-order MDPs. In: PLMUDW (2006)
Hölldobler, S., Schneeberger, J.: A new deductive approach to planning. New Generation Computing 8, 225–244 (1990)
Thielscher, M.: Introduction to the fluent calculus. ETAI (1998)
Boutilier, C., Reiter, R., Price, B.: Symbolic Dynamic Programming for First-Order MDPs. In: IJCAI (2001)
Hölldobler, S., Skvortsova, O.: A Logic-Based Approach to Dynamic Programming. In: AAAI Workshop (2004)
Younes, H.L.S., Littman, M.L., Weissman, D., Asmuth, J.: The first probabilistic track of the International Planning Competition. JAIR 24, 851–887 (2005)
Di Mauro, N., Basile, T.M.A., Ferilli, S., Esposito, F., Fanizzi, N.: An exhaustive matching procedure for the improvement of learning efficiency. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, Springer, Heidelberg (2003)
Kersting, K., van Otterlo, M., de Raedt, L.: Bellman goes relational. In: ICML (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skvortsova, O. (2007). θ-Subsumption Based on Object Context. In: Muggleton, S., Otero, R., Tamaddoni-Nezhad, A. (eds) Inductive Logic Programming. ILP 2006. Lecture Notes in Computer Science(), vol 4455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73847-3_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-73847-3_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73846-6
Online ISBN: 978-3-540-73847-3
eBook Packages: Computer ScienceComputer Science (R0)