Minimal change: Relevance and recovery revisited

Ribeiro, Márcio Moretto; Wassermann, Renata; Flouris, Giorgos; Antoniou, Grigoris

doi:10.1016/j.artint.2013.06.001

Cited by 21 publications

(38 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, many non-classical logics such as description logics, equational logic or Horn clause logic, widely used for various modern applications in computing science, do not satisfy such a constraint. Recently, in many works, belief change has been studied in such non-classical logics [12,17,33,34]. In this direction, we can cite Ribeiro & al.'s work in [34] that studies contraction at the abstract level of Tarskian logics, and the recent work in [40] on the extension of AGM contraction to arbitrary logics.…”

mentioning

confidence: 99%

“…Recently, in many works, belief change has been studied in such non-classical logics [12,17,33,34]. In this direction, we can cite Ribeiro & al.'s work in [34] that studies contraction at the abstract level of Tarskian logics, and the recent work in [40] on the extension of AGM contraction to arbitrary logics. The adaptation of AGM postulates for revision for non-classical logics has been studied but only for specific logics, mainly description logics [16,17,27,28,30,32,39] and Horn logics [11,41].…”

mentioning

confidence: 99%

“…In [22] some AGM postulates are interpreted in terms of minimal change, in the sense that the models of the revision should be as close as possible, according to some metric, to the models of the initial knowledge set. Recently, both for contraction and revision, generalizations of the AGM theory have been proposed in the framework of Tarskian Logics considering minimality criteria on removed formulas [33,34]. The aim was to study contraction and revision for a larger family of logics containing non-classical ones such as description logics and Horn logics.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Belief revision, minimal change and relaxation: A general framework based on satisfaction systems, and applications to description logics

Aiguier

Atif

Bloch

et al. 2018

Artificial Intelligence

View full text Add to dashboard Cite

Belief revision of knowledge bases represented by a set of sentences in a given logic has been extensively studied but for specific logics, mainly propositional, and also recently Horn and description logics. Here, we propose to generalize this operation from a modeltheoretic point of view, by defining revision in an abstract model theory known under the name of satisfaction systems. In this framework, we generalize to any satisfaction systems the characterization of the well known AGM postulates given by Katsuno and Mendelzon for propositional logic in terms of minimal change among interpretations. Moreover, we study how to define revision, satisfying the AGM postulates, from relaxation notions that have been first introduced in description logics to define dissimilarity measures between concepts, and the consequence of which is to relax the set of models of the old belief until it becomes consistent with the new pieces of knowledge. We show how the proposed general framework can be instantiated in different logics such as propositional, first-order, description and Horn logics. In particular for description logics, we introduce several concrete relaxation operators tailored for the description logic ALC and its fragments EL and ELU , discuss their properties and provide some illustrative examples.

show abstract

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Belief revision, minimal change and relaxation: A general framework based on satisfaction systems, and applications to description logics

Aiguier

Atif

Bloch

et al. 2018

Artificial Intelligence

View full text Add to dashboard Cite

show abstract

“…Recovery has been criticised by many researchers among which Hansson (1991) argued that it is an emerging property rather than a fundamental postulate for contraction. One evidence is that other than the contraction itself, its satisfaction relies also on properties (viz, AGM-compliance) of the underlying logic (Ribeiro et al, 2013). In particular most of the DLs including DL-Lite are incompatible with Recovery.…”

Section: Eliminating Axioms From a Tboxmentioning

confidence: 99%

“…In a more general setting, Ribeiro et al (2013) identified properties of a monotonic logic under which a contraction function can be defined that satisfies the Recovery postulate. By their result, DL-Lite is not one such logic, which is consistent with ours (i.e., Theorem 11).…”

Section: Related Workmentioning

confidence: 99%

DL-Lite Contraction and Revision

Zhuang¹,

Wang²,

Wang³

et al. 2016

jair

View full text Add to dashboard Cite

Two essential tasks in managing description logic knowledge bases are eliminating problematic axioms and incorporating newly formed ones. Such elimination and incorporation are formalised as the operations of contraction and revision in belief change. In this paper, we deal with contraction and revision for the DL-Lite family through a model-theoretic approach. Standard description logic semantics yields an infinite number of models for DL-Lite knowledge bases, thus it is difficult to develop algorithms for contraction and revision that involve DL models. The key to our approach is the introduction of an alternative semantics called type semantics which can replace the standard semantics in characterising the standard inference tasks of DL-Lite. Type semantics has several advantages over the standard one. It is more succinct and importantly, with a finite signature, the semantics always yields a finite number of models. We then define model-based contraction and revision functions for DL-Lite knowledge bases under type semantics and provide representation theorems for them. Finally, the finiteness and succinctness of type semantics allow us to develop tractable algorithms for instantiating the functions.

show abstract

Towards a Theory of Hyperintensional Belief Change

Souza

2020

Intelligent Systems

View full text Add to dashboard Cite

Minimal change: Relevance and recovery revisited

Cited by 21 publications

References 11 publications

Belief revision, minimal change and relaxation: A general framework based on satisfaction systems, and applications to description logics

Belief revision, minimal change and relaxation: A general framework based on satisfaction systems, and applications to description logics

DL-Lite Contraction and Revision

Towards a Theory of Hyperintensional Belief Change

Contact Info

Product

Resources

About