Complexity of the Description Logic ALCM

11/12/2015
by   Monica Martinez, et al.
0

In this paper we show that the problem of checking consistency of a knowledge base in the Description Logic ALCM is ExpTime-complete. The M stands for meta-modelling as defined by Motz, Rohrer and Severi. To show our main result, we define an ExpTime Tableau algorithm as an extension of an algorithm for checking consistency of a knowledge base in ALC by Nguyen and Szalas.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2014

Reasoning for ALCQ extended with a flexible meta-modelling hierarchy

This works is motivated by a real-world case study where it is necessary...
research
08/27/2019

Extending Description Logic EL++ with Linear Constraints on the Probability of Axioms

One of the main reasons to employ a description logic such as EL or EL++...
research
11/15/2021

The Choice of Knowledge Base in Automated Claim Checking

Automated claim checking is the task of determining the veracity of a cl...
research
11/02/2019

Statistical EL is ExpTime-complete

We show that consistency of Statistical EL knowledge bases, as defined b...
research
05/18/2018

A set-based reasoner for the description logic (Extended Version)

We present a -based implementation of a reasoner for a decidable fragmen...
research
04/04/2009

Optimal Tableau Decision Procedures for PDL

We reformulate Pratt's tableau decision procedure of checking satisfiabi...
research
07/25/2017

A Decidable Very Expressive Description Logic for Databases (Extended Version)

We introduce DLR^+, an extension of the n-ary propositionally closed des...

Please sign up or login with your details

Forgot password? Click here to reset