Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend!

01/16/2014
by   Sebastian Rudolph, et al.
0

Description Logics are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries, the standard query language in databases, have recently gained significant attention as an expressive formalism for querying Description Logic knowledge bases. Several different techniques for deciding conjunctive query entailment are available for a wide range of DLs. Nevertheless, the combination of nominals, inverse roles, and number restrictions in OWL 1 and OWL 2 DL causes unsolvable problems for the techniques hitherto available. We tackle this problem and present a decidability result for entailment of unions of conjunctive queries in the DL ALCHOIQb that contains all three problematic constructors simultaneously. Provided that queries contain only simple roles, our result also shows decidability of entailment of (unions of) conjunctive queries in the logic that underpins OWL 1 DL and we believe that the presented results will pave the way for further progress towards conjunctive query entailment decision procedures for the Description Logics underlying the OWL standards.

READ FULL TEXT
research
10/22/2020

On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles

We study the description logic SQ with number restrictions applicable to...
research
02/14/2020

Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints

We introduce and investigate the expressive description logic (DL) ALCSC...
research
11/19/2020

Conservative Extensions in Horn Description Logics with Inverse Roles

We investigate the decidability and computational complexity of conserva...
research
02/04/2014

Optimizing SPARQL Query Answering over OWL Ontologies

The SPARQL query language is currently being extended by the World Wide ...
research
05/16/2014

Algorithm for Adapting Cases Represented in a Tractable Description Logic

Case-based reasoning (CBR) based on description logics (DLs) has gained ...
research
04/13/2023

Decidability of Querying First-Order Theories via Countermodels of Finite Width

We propose a generic framework for establishing the decidability of a wi...

Please sign up or login with your details

Forgot password? Click here to reset