Overcoming Ontology Mismatches in Transactions with Self-Describing Service Agents Drew McDermott Yale University

First Page		Document Content
Date: 2012-08-02 20:52:33 Computability theory Theoretical computer science Automated planning and scheduling Artificial intelligence Cognitive science Mathematics Partial-order planning Planning Domain Definition Language Intelligent agent Computability Algorithm Philosophy of artificial intelligence		Overcoming Ontology Mismatches in Transactions with Self-Describing Service Agents Drew McDermott Yale University Add to Reading List Source URL: www.kestrel.edu Download Document from Source Website File Size: 82,63 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