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

	Under consideration for publication in Theory and Practice of Logic Programming 1 Horn Clauses as an Intermediate Representation for Program Analysis and Transformation∗ DocID: 1xUvR - View Document
	Differentiable Inductive Logic Programming Richard Evans, Ed Grefenstette @LittleBimble, @egrefen https://jair.org/index.php/jair/article/view/11172 DocID: 1xTa2 - View Document
	WHAT IS SPACECHEM? SpaceChem is an intriguing, "problem-solving centric" puzzle game by Zachtronics Industries that combines the logic of computer programming with the scientific domain of chemistry, set in an original s DocID: 1vmld - View Document
	Experiences Using an Interactive Presentation Platform in a Functional and Logic Programming Course DocID: 1uM8H - View Document
	See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publicationAnalysis of Performance of Various Activation Functions for doing the logic programming in Hopfield DocID: 1uzA8 - View Document