Summary: Machinery for Elaborating Action 0:2fi1
Eyal Amir
Department of Computer Science,
Gates Building, 2A wing
Stanford University, Stanford, CA 94305­9020, USA
eyala@cs.stanford.edu
Abstract
We present a method for elaborating action without
the need to amend the knowledge already present in
the database. It does that by reifying the elaboration,
and by introducing a new action for every elaboration
that we add. This method is built on top of an existing
action formalism that applies situation calculus and
circumscription. Finally we argue that the method is
applicable to a variety of action formalisms.
Introduction
Our long term program deals with the Elaboration Tol­
erance of formalisms of knowledge. Elaboration Tol­
erance is a term coined by McCarthy in (McCarthy
1993) and used ever since in describing one of the more

Source: Amir, Eyal - Department of Computer Science, University of Illinois at Urbana-Champaign

Collections: Computer Technologies and Information Sciences