LiU Electronic Press
Full-text not available in DiVA
Author:
Doherty, Patrick (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Lukaszewicz, Witold (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
Circumscribing features and fluents
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Chapter in book (Refereed)
Language:
English
In:
Temporal Logic: First International Conference, ICTL'94 Bonn, Germany, July 11–14, 1994 Proceedings
Editor:
Dov M. Gabbay and Hans Jürgen Ohlbach
Place of publ.: Berlin/New York Publisher: Springer Berlin/Heidelberg
Series:
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online); 827
Pages:
82-100
Year of publ.:
1994
URI:
urn:nbn:se:liu:diva-41444
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-41444
ISBN:
3-540-58241-X (Berlin), 0-387-58241-X (New York)
Local ID:
56594
Subject category:
Computer Science
SVEP category:
Computer science
Keywords(sv) :
Temporal logik
Abstract(en) :

Sandewall has recently proposed a systematic approach to the representation of knowledge about dynamical systems that includes a general framework in which to assess the range of applicability of existing and new logics for action and change and to provide a means of studying whether and in what sense the logics of action and change are relevant for intelligent agents. As part of the framework, a number of logics of preferential entailment are introduced and assessed for particular classes of action scenario descriptions. This paper provides syntactic characterizations of several of these relations of preferential entailment in terms of standard FOPC and circumscription axioms. The intent is to simplify the process of comparison with existing formalisms which use more traditional techniques and to provide a basis for studying the feasibility of compiling particular classes of problems into logic programs.

Available from:
2009-10-10
Created:
2009-10-10
Last updated:
2014-04-02
Statistics:
32 hits