{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:14:54Z","timestamp":1725491694416},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738466"},{"type":"electronic","value":"9783540738473"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73847-3_36","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T03:23:12Z","timestamp":1190172192000},"page":"394-408","source":"Crossref","is-referenced-by-count":0,"title":["\u03b8-Subsumption Based on Object Context"],"prefix":"10.1007","author":[{"given":"Olga","family":"Skvortsova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.575","volume":"11","author":"C. Boutilier","year":"1999","unstructured":"Boutilier, C., Dean, T., Hanks, S.: Decision-theoretic planning: Structural assumptions and computational leverage. JAIR\u00a011, 1\u201394 (1999)","journal-title":"JAIR"},{"issue":"1-2","key":"36_CR2","first-page":"81","volume":"72","author":"A.G. Barto","year":"1995","unstructured":"Barto, A.G., Bradtke, S.J., Singh, S.P.: Learning to act using real-time dynamic programming. AI\u00a072(1-2), 81\u2013138 (1995)","journal-title":"AI"},{"key":"36_CR3","unstructured":"Feng, Z., Hansen, E.: Symbolic heuristic search for factored Markov Decision Processes. In: AAAI (2002)"},{"key":"36_CR4","unstructured":"Hoey, J., St-Aubin, R., Hu, A., Boutilier, C.: SPUDD: Stochastic Planning using Decision Diagrams. In: UAI (1999)"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"H\u00f6lldobler, S., Karabaev, E., Skvortsova, O.: FluCaP: A heuristic search planner for first-order MDPs. JAIR 2006 (to appear)","DOI":"10.1613\/jair.1965"},{"key":"36_CR6","unstructured":"H\u00f6lldobler, S., Skvortsova, O.: LIFT-UP: Lifted first-order planning under uncetainty. In: IWIL 2006 (to appear)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"8th International Conference on Automated Deduction","author":"D. Kapur","year":"1986","unstructured":"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.\u00a0230, Springer, Heidelberg (1986)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Kietz, J.-U., L\u00fcbbe, M.: An efficient subsumption algorithm for inductive logic programming. In: ICML (1994)","DOI":"10.1016\/B978-1-55860-335-6.50024-6"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Maloberti, J., Sebag, M.: Fast theta-subsumption with constraint satisfaction algorithms. ML\u00a055(2) (2004)","DOI":"10.1023\/B:MACH.0000023150.80092.40"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Inductive Logic Programming","author":"T. Scheffer","year":"1997","unstructured":"Scheffer, T., Herbrich, R., Wysotzki, F.: Efficient \u03b8-subsumption based on graph algorithms. In: Inductive Logic Programming. LNCS, vol.\u00a01314, Springer, Heidelberg (1997)"},{"key":"36_CR11","unstructured":"Karabaev, E., Ramm\u00e9, G., Skvortsova, O.: Efficient symbolic reasoning for first-order MDPs. In: PLMUDW (2006)"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF03037518","volume":"8","author":"S. H\u00f6lldobler","year":"1990","unstructured":"H\u00f6lldobler, S., Schneeberger, J.: A new deductive approach to planning. New Generation Computing\u00a08, 225\u2013244 (1990)","journal-title":"New Generation Computing"},{"key":"36_CR13","unstructured":"Thielscher, M.: Introduction to the fluent calculus. ETAI (1998)"},{"key":"36_CR14","unstructured":"Boutilier, C., Reiter, R., Price, B.: Symbolic Dynamic Programming for First-Order MDPs. In: IJCAI (2001)"},{"key":"36_CR15","unstructured":"H\u00f6lldobler, S., Skvortsova, O.: A Logic-Based Approach to Dynamic Programming. In: AAAI Workshop (2004)"},{"key":"36_CR16","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1613\/jair.1880","volume":"24","author":"H.L.S. Younes","year":"2005","unstructured":"Younes, H.L.S., Littman, M.L., Weissman, D., Asmuth, J.: The first probabilistic track of the International Planning Competition. JAIR\u00a024, 851\u2013887 (2005)","journal-title":"JAIR"},{"key":"36_CR17","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Inductive Logic Programming","author":"N. Mauro Di","year":"2003","unstructured":"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\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, Springer, Heidelberg (2003)"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Kersting, K., van Otterlo, M., de Raedt, L.: Bellman goes relational. In: ICML (2004)","DOI":"10.1145\/1015330.1015401"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73847-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:02:52Z","timestamp":1619517772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73847-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738466","9783540738473"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73847-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}