The SUPREM architecture: a new intelligent paradigm
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Eliminating the fixed predicates from a circumscription
Artificial Intelligence
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
The expressive power of circumscription
Artificial Intelligence
Note about cardinality-based circumscription
Artificial Intelligence
Credulous nonmonotonic inference
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Reasoning about Typicality in Preferential Description Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
A(general) preferential entailment is defined by a "preference relation" among "states". States can be either interpretations or sets of interpretations, or "copies" of interpretations or of sets of interpretations, although it is known that the second kind and the fourth one produce the same notion. Circumscription is a special case of the simplest kind, where the states are interpretations. It is already known that a large class of preferential entailments where the states are copies of interpretations, namely the "cumulative" ones, can be expressed as circumscriptions in a greater vocabulary. We extend this result to the most general kind of general preferential entailment, the additional property requested here is "loop", a strong kind of "cumulativity". The greater vocabulary needed here is large, but only a very simple and small set of formulas in this large vocabulary is necessary, which should make the method practically useful.