Abstract. 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.
The tableau algorithm implemented in the FaCT knowledge representation system decides satisfiability...
As applications of description logics proliferate, efficient reasoning with knowledge bases containi...
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of ...
Conjunctive queries play an important role as an expressive query language in Description Logics (DL...
Abstract. We propose a novel method for reasoning in the description logic SHIQ. After a satisfiabil...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
We propose a novel method for reasoning in the description logic SHIQ. After a satisfiability preser...
Abstract. An important reasoning task, in addition to the standard DL reasoning services, is conjunc...
Abstract. We present a procedure for deciding (database) query containment under constraints. The te...
A Description Logic (DL) system is charac-terized by four fundamental aspects: the set of constructs...
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent ...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
We propose a novel, type-elimination-based method for standard reasoning in the description logic SH...
Query containment under constraints is the problem of determining whether the result of one query is...
AbstractAnswering conjunctive queries (CQs) has been recognized as an important task for the widenin...
The tableau algorithm implemented in the FaCT knowledge representation system decides satisfiability...
As applications of description logics proliferate, efficient reasoning with knowledge bases containi...
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of ...
Conjunctive queries play an important role as an expressive query language in Description Logics (DL...
Abstract. We propose a novel method for reasoning in the description logic SHIQ. After a satisfiabil...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
We propose a novel method for reasoning in the description logic SHIQ. After a satisfiability preser...
Abstract. An important reasoning task, in addition to the standard DL reasoning services, is conjunc...
Abstract. We present a procedure for deciding (database) query containment under constraints. The te...
A Description Logic (DL) system is charac-terized by four fundamental aspects: the set of constructs...
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent ...
Conjunctive queries play an important role as an expressive query language for Description Logics (D...
We propose a novel, type-elimination-based method for standard reasoning in the description logic SH...
Query containment under constraints is the problem of determining whether the result of one query is...
AbstractAnswering conjunctive queries (CQs) has been recognized as an important task for the widenin...
The tableau algorithm implemented in the FaCT knowledge representation system decides satisfiability...
As applications of description logics proliferate, efficient reasoning with knowledge bases containi...
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of ...