Defaults and revision in structured theories
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 362-373
- https://doi.org/10.1109/lics.1991.151660
Abstract
Starting from a logic which specifies how to make deductions from a set of sentences (a flat theory), a way to generalize this to a partially ordered bag of sentences (a structured theory) is given. The partial order is used to resolve conflicts. If phi occurs below psi , then psi is accepted only insofar as it does not conflict with phi . The study starts with a language L, a set of interpretations M and a satisfaction relation. The key idea is to define, for each structured theory, a preorder on interpretations. Models of the structured theory are defined to be maximal interpretations in the ordering. A revision operator that takes a structured theory and a sentence and returns a structured theory is defined. The consequence relation has the properties of weak monotonicity, weak cut, and weak reflexivity with respect to this operator, but fails their strong counterparts.Keywords
This publication has 3 references indexed in Scilit:
- Sharing actions and attributes in modal action logicPublished by Springer Nature ,1991
- A skeptical theory of inheritance in nonmonotonic semantic networksArtificial Intelligence, 1990
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980