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

	Speaker: Jason Rute Title: Randomness, Brownian Motion, Riesz Capacity, and Complexity Abstract: Algorithmic randomness is a topic in computability theory which investigates which paths in a stochastic process behave ran DocID: 1sWjT - View Document
	In pursuit of decidable ‘logical form’ Michael Minock TCS/CSC KTH Royal Institute of Technology, Stockholm, Sweden Abstract DocID: 1rsvH - View Document
	Curriculum and Course Syllabi for a High-School Program in Computer Science1 Judith Gal-Ezer2 David Harel3 DocID: 1rozw - View Document
	A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi DocID: 1rjEK - View Document
	Steve Warner Curriculum Vitae Department of Mathematics Hofstra University Hempstead, NY 11549 DocID: 1rjw8 - View Document