To preference via entrenchment
type: Item
instance of: scholarly article
title: To preference via entrenchment
zbMATH Open document ID: 0956.03012
DOI: 10.1016/S0168-0072(98)00036-0
author: Konstantinos Georgatos
published in: Annals of Pure and Applied Logic
publication date: 1999-11-22T00:00:00Z
review text: Preferential models represent an important step in knowledge representation theory, and the preferential entailment on models whose preferential relation satisfies additional second-order properties of smoothness or stopperedness can be characterized by a system P fulfilling the following eight axioms: Supraclassicality, Left logical equivalence, Right weakening, And, Cut Cautious monotonicity, Or, and Weak transitivity. The aim of this paper is to introduce a binary relation among sentences, called partial entrenchment, that represents a simple generalization of Gärdenfors and Makinson's epistemic entrenchment, and has the features of being monotonic and expressing extensions. Several of the obtained results have to be mentioned: (1) Any class of sentences satisfying the system P can be generated as the intersection of partial entrenchment extensions. (2) The subclass of partial entrenchments consisting of total preorders is Gärdenfors and Makinson's expectation orderings which characterize previous notions of expectation inference and rational inference. (3) Restricting the class of expectation orderings with properties parameterized by theories, one gets epistemic entrenchment, a well-known class of linear preorders of sentences characterizing the AGM (Alchourrón-Gärdenfors-Makinson) postulates for belief revision. (4) A further generalization of partial entrenchment can lead to a uniform characterization of all nonmonotonic inference relations. The paper is organized as follows: Section 2 introduces partial entrenchment, explains its role, and compares its features to other approaches. Section 3 defines a monotonic consequence relation based on partial entrenchment, called maxiconsistent inference, and proves some of its properties. The maxiconsistent consequence is proved to satisfy the properties of the axiom system P. The final Section 4 shows that every preferential consequence relation can be expressed as a maxiconsistent inference of a partial entrenchment…
reviewed by: Neculai Curteanu
Mathematics Subject Classification ID: 03B42
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 1308107
zbMATH Keywords: knowledge representation
zbMATH Keywords: preferential models
zbMATH Keywords: epistemic entrenchment
zbMATH Keywords: partial entrenchment
zbMATH Keywords: belief revision
zbMATH Keywords: maxi-consistent inference
zbMATH Keywords: sceptical nonmonotonic reasoning
MaRDI profile type: Publication
cites work: On the logic of theory change: Partial meet contraction and revision functions
cites work: Epistemic entrenchment and possibilistic logic
cites work: From ordering-based nonmonotonic reasoning to conditional logics
cites work: Injective Models and Disjunctive Relations
cites work: Q3703316
cites work: Q3495345
cites work: Nonmonotonic inference based on expectations
cites work: Ordering-based representations of rational inference
cites work: Q1592478
cites work: Nonmonotonic reasoning, preferential models and cumulative logics
cites work: What does a conditional knowledge base entail?
cites work: Counterfactuals.
cites work: Q4260397
cites work: Q3829532
cites work: Q4296748
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Preferential belief change using generalized epistemic entrenchment
cites work: Q4131415
cites work: Fuzzy sets as a basis for a theory of possibility
description: scientific article; zbMATH DE number 1308107