Reasoning with Individuals for the Description Logic SHIQ

05/11/2000
by   Ian Horrock, et al.
0

While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. In this paper we present an algorithm for combined Tbox and Abox reasoning in the SHIQ description logic. This algorithm is of particular interest as it can be used to decide the problem of (database) conjunctive query containment w.r.t. a schema. Moreover, the realisation of an efficient implementation should be relatively straightforward as it can be based on an existing highly optimised implementation of the Tbox algorithm in the FaCT system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2000

Defeasible Reasoning in OSCAR

This is a system description for the OSCAR defeasible reasoner....
research
06/10/2017

Towards Statistical Reasoning in Description Logics over Finite Domains (Full Version)

We present a probabilistic extension of the description logic ALC for re...
research
05/09/2000

Reasoning with Axioms: Theory and Pratice

When reasoning in description, modal or temporal logics it is often usef...
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
05/27/2011

A Temporal Description Logic for Reasoning about Actions and Plans

A class of interval-based temporal languages for uniformly representing ...
research
05/27/2011

Extensible Knowledge Representation: the Case of Description Reasoners

This paper offers an approach to extensible knowledge representation and...
research
11/26/2009

A Semantic Similarity Measure for Expressive Description Logics

A totally semantic measure is presented which is able to calculate a sim...

Please sign up or login with your details

Forgot password? Click here to reset