arrow
Return

Note about cardinality-based circumscription

delete2000-05-01
delete4
PRE
AI
M
Moinard, Y *
DOI:10.1016/S0004-3702(00)00018-7delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In a very interesting paper, Liberatore and Schaerf showed how to express the leading proposals of belief revision using a circumscription. In order to deal with one of the belief revision theories, they had to introduce a new circumscription, based on the cardinality instead of the classical set inclusion. We dgive a few properties of this new circumscription. In doing so, we prove that in the finite case, there is inter-definability between ordinary circumscription and cardinality-based circumscription. We show why a technical result published in the initial paper cannot be true, and we give a related result which is true instead, where the respective roles of the varying or fixed propositions are reversed. This result could help automatic computation. We use the logical properties of circumscriptions and cardinality-based circumscriptions in order to highlight the behavior of cardinality-based circumscription and the importance of the fixed propositions. This study allows a full description of the expressive power of cardinality-based circumscription in the finite case, and it provides some limitations in the infinite case. (C) 2000 Elsevier Science B.V. All rights reserved.
Keywords:
circumscription
common sense reasoning
knowledge representation
nonmonotonic reasoning
preferential entailment
belief revision
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Artificial Intelligence Review cover
Artificial Intelligence Review
IF:
13.9
Papers:
6.1K
Citations:
1.9W

Organization

No organization information available
Cited Papers

Cited Papers

errShare
errSave
errShare
errSave
researcher View more