Relaxation-based revision operators in description logics

by   Marc Aiguier, et al.

As ontologies and description logics (DLs) reach out to a broader audience, several reasoning services are developed in this context. Belief revision is one of them, of prime importance when knowledge is prone to change and inconsistency. In this paper we address both the generalization of the well-known AGM postulates, and the definition of concrete and well-founded revision operators in different DL families. We introduce a model-theoretic version of the AGM postulates with a general definition of inconsistency, hence enlarging their scope to a wide family of non-classical logics, in particular negation-free DL families. We propose a general framework for defining revision operators based on the notion of relaxation, introduced recently for defining dissimilarity measures between DL concepts. A revision operator in this framework amounts to relax the set of models of the old belief until it reaches the sets of models of the new piece of knowledge. We demonstrate that such a relaxation-based revision operator defines a faithful assignment and satisfies the generalized AGM postulates. Another important contribution concerns the definition of several concrete relaxation operators suited to the syntax of some DLs (ALC and its fragments EL and ELU).


page 1

page 2

page 3

page 4


Defeasible reasoning in Description Logics: an overview on DL^N

DL^N is a recent approach that extends description logics with defeasibl...

Description Logics with Abstraction and Refinement

Ontologies often require knowledge representation on multiple levels of ...

A connection method for a defeasible extension of 𝒜ℒ𝒞ℋ

This paper proposes a connection method à la Bibel for an exception-tole...

Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction

The aim of this paper is to introduce a new framework for defining abduc...

Geometric Models for (Temporally) Attributed Description Logics

In the search for knowledge graph embeddings that could capture ontologi...

BitSim: An Algebraic Similarity Measure for Description Logics Concepts

In this paper, we propose an algebraic similarity measure σBS (BS stands...

A Syntactic Operator for Forgetting that Satisfies Strong Persistence

Whereas the operation of forgetting has recently seen a considerable amo...

Please sign up or login with your details

Forgot password? Click here to reset