@article{Kersting:2004,
  abstract = {Motivated by the interest in relational reinforcement
	
	learning, we introduce a novel
	
	relational Bellman update operator called
	
	ReBel. It employs a constraint logic programming
	
	language to compactly represent
	
	Markov decision processes over relational domains.
	
	Using ReBel, a novel value iteration
	
	algorithm is developed in which abstraction
	
	(over states and actions) plays a major role.
	
	This framework provides new insights into relational
	
	reinforcement learning. Convergence
	
	results as well as experiments are presented.},
  author = {Kersting, Kristian and Otterlo, Martijn Van and Raedt, Luc De},
  interhash = {640ed3c7c9747d4da813c1bff4eaf47e},
  intrahash = {6811a3df8d0e864d523b5d6263262dcb},
  journal = {Proceedings of the Twenty-First International Conference on Machine
	Learning ({ICML}-2004)},
  pages = {465-472},
  title = {Bellman goes Relational},
  year = 2004
}

{"_id":"LswNJjCWq5sBR79GX","bibbaseid":"kersting-otterlo-raedt-bellmangoesrelational-2004","downloads":0,"creationDate":"2017-04-22T09:30:53.779Z","title":"Bellman goes Relational","author_short":["Kersting, K.","Otterlo, M. V.","Raedt, L. D."],"year":2004,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Kristian Kersting?items=1000","bibdata":{"bibtype":"article","type":"article","abstract":"Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming language to compactly represent Markov decision processes over relational domains. Using ReBel, a novel value iteration algorithm is developed in which abstraction (over states and actions) plays a major role. This framework provides new insights into relational reinforcement learning. Convergence results as well as experiments are presented.","author":[{"propositions":[],"lastnames":["Kersting"],"firstnames":["Kristian"],"suffixes":[]},{"propositions":[],"lastnames":["Otterlo"],"firstnames":["Martijn","Van"],"suffixes":[]},{"propositions":[],"lastnames":["Raedt"],"firstnames":["Luc","De"],"suffixes":[]}],"interhash":"640ed3c7c9747d4da813c1bff4eaf47e","intrahash":"6811a3df8d0e864d523b5d6263262dcb","journal":"Proceedings of the Twenty-First International Conference on Machine Learning (ICML-2004)","pages":"465-472","title":"Bellman goes Relational","year":"2004","bibtex":"@article{Kersting:2004,\n abstract = {Motivated by the interest in relational reinforcement\r\n\t\r\n\tlearning, we introduce a novel\r\n\t\r\n\trelational Bellman update operator called\r\n\t\r\n\tReBel. It employs a constraint logic programming\r\n\t\r\n\tlanguage to compactly represent\r\n\t\r\n\tMarkov decision processes over relational domains.\r\n\t\r\n\tUsing ReBel, a novel value iteration\r\n\t\r\n\talgorithm is developed in which abstraction\r\n\t\r\n\t(over states and actions) plays a major role.\r\n\t\r\n\tThis framework provides new insights into relational\r\n\t\r\n\treinforcement learning. Convergence\r\n\t\r\n\tresults as well as experiments are presented.},\n author = {Kersting, Kristian and Otterlo, Martijn Van and Raedt, Luc De},\n interhash = {640ed3c7c9747d4da813c1bff4eaf47e},\n intrahash = {6811a3df8d0e864d523b5d6263262dcb},\n journal = {Proceedings of the Twenty-First International Conference on Machine\r\n\tLearning ({ICML}-2004)},\n pages = {465-472},\n title = {Bellman goes Relational},\n year = 2004\n}\n\n","author_short":["Kersting, K.","Otterlo, M. V.","Raedt, L. D."],"key":"Kersting:2004","id":"Kersting:2004","bibbaseid":"kersting-otterlo-raedt-bellmangoesrelational-2004","role":"author","urls":{},"downloads":0,"html":""},"search_terms":["bellman","goes","relational","kersting","otterlo","raedt"],"keywords":[],"authorIDs":[],"dataSources":["2dhg9tYJkrmDqBQKQ"]}