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 Theoretical computer science Mathematical logic Mathematics Logic in computer science Boolean algebra Logic programming Automated planning and scheduling Formal methods Situation calculus Planning Domain Definition Language Boolean satisfiability problem Conjunctive normal form		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: www.cs.huji.ac.il Download Document from Source Website File Size: 479,09 KB Share Document on Facebook

	Robot Location Estimation in the Situation Calculus Vaishak Belle and Hector J. Levesque Dept. of Computer Science University of Toronto ICAPS Workshop on Planning and Robotics, June 2013 DocID: 1uXeI - View Document
	I N F S Y S R E S E A R C H R DocID: 1riTl - 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
	Adaptive Multi-Agent Programming in GTGolog Alberto Finzi1, 2 and Thomas Lukasiewicz2, 1 1 2 DocID: 1q99R - View Document
	Logical Circuit Filtering Dafna Shahaf and Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,eyal}@uiuc.edu DocID: 1p49M - View Document