Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Representation theory for default logic

Representation theory for default logic Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of extensions of a default theory. We give a complete solution to the problem of representability by means of default theories with finite set of defaults, and by means of normal default theories. We obtain partial results on representability by arbitrary (infinite, non-normal) default theories. We construct examples of denumerable families of non-including theories that are not representable. We also study the concept of equivalence between default theories. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Representation theory for default logic

Download PDF
16 pages

Loading next page...
 
/lp/springer-journals/representation-theory-for-default-logic-EOXtKJ0Uj0

References (17)

Publisher
Springer Journals
Copyright
Copyright © 1997 by Kluwer Academic Publishers
Subject
Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics); Mathematics, general; Complexity
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1023/A:1018977721624
Publisher site
See Article on Publisher Site

Abstract

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of extensions of a default theory. We give a complete solution to the problem of representability by means of default theories with finite set of defaults, and by means of normal default theories. We obtain partial results on representability by arbitrary (infinite, non-normal) default theories. We construct examples of denumerable families of non-including theories that are not representable. We also study the concept of equivalence between default theories.

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: Oct 17, 2004

There are no references for this article.