Decidability of an Expressive Description Logic with Rational Grading

05/24/2019
by   Mitko Yanchev, et al.
0

In this paper syntactic objects---concept constructors called part restrictions which realize rational grading are considered in Description Logics (DLs). Being able to convey statements about a rational part of a set of successors, part restrictions essentially enrich the expressive capabilities of DLs. We examine an extension of well-studied DL ALCQIHR+ with part restrictions, and prove that the reasoning in the extended logic is still decidable. The proof uses tableaux technique augmented with indices technique, designed for dealing with part restrictions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2021

A Rational Entailment for Expressive Description Logics via Description Logic Programs

Lehmann and Magidor's rational closure is acknowledged as a landmark in ...
research
06/01/2011

The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics

We study the complexity of the combination of the Description Logics ALC...
research
12/30/2019

The Challenge of Unifying Semantic and Syntactic Inference Restrictions

While syntactic inference restrictions don't play an important role for ...
research
12/12/2012

Modeling in OWL 2 without Restrictions

The Semantic Web ontology language OWL 2 DL comes with a variety of lang...
research
07/27/2021

Efficient TBox Reasoning with Value Restrictions using the ℱℒ_ower reasoner

The inexpressive Description Logic (DL) ℱℒ_0, which has conjunction and ...
research
08/26/2019

The Identification Problem for Linear Rational Expectations Models

We consider the problem of the identification of stationary solutions to...
research
08/25/2020

Powerful Inference

We develop an inference method for a (sub)vector of parameters identifie...

Please sign up or login with your details

Forgot password? Click here to reset