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

	Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis Andrew Ireland and Jamie Stark School of Mathematical & Computer Sciences Heriot-Watt University, Edinburgh, Scotland, UK DocID: 1sw2p - View Document
	LGOAP: adaptive layered planning for real-time videogames Giuseppe Maggiore∗ , Carlos Santos∗ , Dino Dini∗ , Frank Peters∗ , Hans Bouwknegt∗ , and Pieter Spronck† ∗ NHTV University of Applied Sciences, Bre DocID: 1pKu7 - View Document
	Reviving Partial Order Planning XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZEmail: fxuanlong, DocID: 1nR2o - View Document
	The GoDeL Planning System: A More Perfect Union of Domain-Independent and Hierarchical Planning Vikas Shivashankar1 Ron Alford1 Ugur Kuter2 Dana Nau1 DocID: 1lFRF - View Document
	A Stubborn Set Algorithm for Optimal Planning 1 and Malte Helmert2 ¨ Yusra Alkhazraji1 and Martin Wehrle2 and Robert Mattmuller Abstract. We adapt a partial order reduction technique based on DocID: 18FQq - View Document