Date: 2010-08-28 23:41:19Logic 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}@uiucAdd to Reading ListSource URL: infolab.stanford.eduDownload Document from Source Website File Size: 479,09 KBShare Document on Facebook
|