Temporary registration page before publication by Linköping University Electronic Press, series Computer and Information Science
The following article is intended to be published shortly by Linköping University Electronic Press. The present page gives access to the article, but does not provide the guarantees of persistence.

Cognitive Robotics Logic and its Metatheory: Features and Fluents Revisited.

Title:Cognitive Robotics Logic and its Metatheory: Features and Fluents Revisited.
Authors: Erik Sandewall
Series:Linköping Electronic Articles in Computer and Information Science
ISSN 1401-9841
Issue:Vol. 3(1998): nr 017
URL: http://www.ep.liu.se/ea/cis/1998/017/

Abstract: Cognitive Robotics Logic (CRL) is an extensible logic language for characterizing actions and change, in particular for use in cognitive robotics. Its development emphasizes the issues of syntax, expressivity, underlying semantics and entailment methods (defined in terms of the semantics). Development of proof methods is de-emphasized. The salient results from this approach refer to the range of applicability and other related properties of the entailment methods. These results constitute a metatheory of actions and change.

CRL is syntactically defined as a base language and a surface language. The base language is characterized by the following aspects:

  • its three major predicates  Holds ,  Occurs , and  Occlude , which provide coherence when the language is extended;

  • its reportoire of categorial functions, which is augmented when additional expressiveness is required in the language.

The surface language provides additional notational convenience, and is defined by translation to the base language.

The range of expressivity includes actions with duration, nondeterministic actions, actions in hybrid worlds with piecewise continuous fluents, some forms of ramification and causation, imprecise sensors and actuators, action failure, and some aspects of goal-directed agent behavior.

Entailment methods are functions that map scenario descriptions to sets of intended models. They are defined using a reportoire of set-theoretic operations on sets of formulas and sets of models, including but not restricted to minimizing a set of models with respect to a preference relation.

A progression of underlying semantics is defined, beginning with the partial state-transition semantics and its immediate generalization, the trajectory semantics. These underlying semantics are used for the formal analysis of the range of applicability of various entailment methods, including both those proposed by the others in this research, and those that developed in the course of the present work.

The present reference article summarizes notation and definitions, so that forthcoming articles can refer to it for that purpose. It does not report on the results that have been obtained with the present approach, except insofar as it is needed for putting the notation into perspective.

Keywords:

Intended publication 1998-10-15 Postscript
Info from authors  
Third-party information  

[About LiEP] [About Checksum validation] [About compression formats]

Editor-in-chief: editor@ep.liu.se
Webmaster: webmaster@ep.liu.se
29-Jun-98 16:48