Show simple item record

dc.contributor.authorAiguier, Marc
dc.contributor.authorAtif, Jamal
dc.contributor.authorBloch, Isabelle
dc.contributor.authorHudelot, Céline
dc.date.accessioned2019-12-09T15:16:48Z
dc.date.available2019-12-09T15:16:48Z
dc.date.issued2018
dc.identifier.issn0004-3702
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/20302
dc.descriptionLe PDF est une version auteur datant de 2017en
dc.language.isoenen
dc.subjectAbstract belief revisionen
dc.subjectRelaxationen
dc.subjectAGM theoryen
dc.subjectSatisfaction systemsen
dc.subjectDescription logicsen
dc.subject.ddc006.3en
dc.titleBelief revision, minimal change and relaxation: A general framework based on satisfaction systems, and applications to description logicsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenBelief 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 model-theoretic point of view, by defining revision in the abstract model theory of satisfaction systems. In this framework, we generalize to any satisfaction system the characterization of the AGM postulates given by Katsuno and Mendelzon for propositional logic in terms of minimal change among interpretations. In this generalization, the constraint on syntax independence is partially relaxed. Moreover, we study how to define revision, satisfying these weakened 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.en
dc.relation.isversionofjnlnameArtificial Intelligence
dc.relation.isversionofjnlvol256en
dc.relation.isversionofjnldate2018-03
dc.relation.isversionofjnlpages160-180en
dc.relation.isversionofdoi10.1016/j.artint.2017.12.002en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelIntelligence artificielleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2019-12-09T14:54:06Z
hal.person.labIds435635
hal.person.labIds989
hal.person.labIds162010
hal.person.labIds435635
hal.identifierhal-01823450*


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record