Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

First Page		Document Content
Date: 2010-08-28 23:41:19 Logic in computer science Logic programming Automated planning and scheduling Formal methods Conjunctive normal form Situation calculus Planning Domain Definition Language Algorithm Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics		Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc Add to Reading List Source URL: infolab.stanford.edu Download Document from Source Website File Size: 479,09 KB Share Document on Facebook

	From FOND to Probabilistic Planning: Guiding search for quality policies Alberto Camacho† , Christian Muise∗ , Akshay Ganeshen† , Sheila A. McIlraith† † Department of Computer Science, University of Toronto Dep DocID: 1rboJ - View Document
	An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract DocID: 1qYdf - View Document
	Microsoft Word - IBSAlgorithms.doc DocID: 1qBzD - View Document
	Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc DocID: 1qzAi - View Document
	Non-Deterministic Planning With Conditional Effects Christian Muise and Sheila A. McIlraith and Vaishak Belle Department of Computer Science University of Toronto, Toronto, Canada. {cjmuise,sheila,vaishak}@cs.toronto.edu DocID: 1qkW7 - View Document