{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:19:03Z","timestamp":1743081543656,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781489976857"},{"type":"electronic","value":"9781489976871"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-1-4899-7687-1_806","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T12:36:42Z","timestamp":1492087002000},"page":"1220-1228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symbolic Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Scott","family":"Sanner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristian","family":"Kersting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"806_CR19352","volume-title":"Dynamic programming","author":"RE Bellman","year":"1957","unstructured":"Bellman RE (1957) Dynamic programming. Princeton University Press, Princeton"},{"key":"806_CR19353","unstructured":"Boutilier C, Reiter R, Price B (2001) Symbolic dynamic programming for first-order MDPs. In: IJCAI-01, Seattle, pp\u00a0690\u2013697"},{"key":"806_CR19354","unstructured":"Fern A, Yoon S, Givan R (2003) Approximate policy iteration with a policy language bias. In: NIPS-2003, Vancouver"},{"key":"806_CR19355","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"RE Fikes","year":"1971","unstructured":"Fikes RE, Nilsson NJ (1971) STRIPS: a new approach to the application of theorem proving to problem solving. Artif Intell 2:189\u2013208","journal-title":"Artif Intell"},{"key":"806_CR19356","unstructured":"Gretton C, Thiebaux S (2004) Exploiting first-order regression in inductive policy selection. In: UAI-04, Banff, pp\u00a0217\u2013225"},{"key":"806_CR19357","unstructured":"Guestrin C, Koller D, Gearhart C, Kanodia N (2003) Generalizing plans to new environments in relational MDPs. In: IJCAI-03, Acapulco"},{"key":"806_CR19358","unstructured":"H\u00f6lldobler S, Skvortsova O (2004) A logic-based approach to dynamic programming. In: AAAI-04 workshop on learning and planning in MDPs, Menlo Park, pp\u00a031\u201336"},{"key":"806_CR19359","unstructured":"Karabaev E, Skvortsova O (2005) A heuristic search algorithm for solving first-order MDPs. In: UAI-2005, Edinburgh, pp\u00a0292\u2013299"},{"key":"806_CR19360","doi-asserted-by":"crossref","unstructured":"Kersting K, van Otterlo M, De Raedt L (2004) Bellman goes relational. In: ICML-04. ACM Press, New York","DOI":"10.1145\/1015330.1015401"},{"key":"806_CR19361","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0004-3702(94)00087-H","volume":"76","author":"N Kushmerick","year":"1995","unstructured":"Kushmerick N, Hanks S, Weld D (1995) An algorithm for probabilistic planning. Artif Intell 76:239\u2013286","journal-title":"Artif Intell"},{"key":"806_CR19362","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"ML Puterman","year":"1994","unstructured":"Puterman ML (1994) Markov decision processes: discrete stochastic dynamic programming. Wiley, New York"},{"key":"806_CR19363","unstructured":"Sanner S, Boutilier C (2005) Approximate linear programming for first-order MDPs. In: UAI-2005, Edinburgh"},{"key":"806_CR19364","unstructured":"Sanner S, Boutilier C (2006) Practical linear evaluation techniques for first-order MDPs. In: UAI-2006, Boston"},{"key":"806_CR19365","unstructured":"Sanner S, Boutilier C (2007) Approximate solution techniques for factored first-order MDPs. In: ICAPS-07, Providence, pp\u00a0288\u2013295"},{"key":"806_CR19366","volume-title":"Policy iteration for relational MDPs","author":"C Wang","year":"2007","unstructured":"Wang C, Khardon R (2007) Policy iteration for relational MDPs. In: UAI, Vancouver"},{"key":"806_CR19367","volume-title":"First order decision diagrams for relational MDPs","author":"C Wang","year":"2007","unstructured":"Wang C, Joshi S, Khardon R (2007) First order decision diagrams for relational MDPs. In: IJCAI, Hyderabad"}],"container-title":["Encyclopedia of Machine Learning and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4899-7687-1_806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T23:00:24Z","timestamp":1591052424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4899-7687-1_806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9781489976857","9781489976871"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4899-7687-1_806","relation":{},"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}