• Corpus ID: 18410323

# A set-theoretical approach for ABox reasoning services (Extended Version)

@article{Cantone2017ASA,
title={A set-theoretical approach for ABox reasoning services (Extended Version)},
author={Domenico Cantone and Marianna Nicolosi Asmundo and Daniele Francesco Santamaria},
journal={ArXiv},
year={2017},
volume={abs/1702.03096}
}
• Published 10 February 2017
• Computer Science
• ArXiv
In this paper we consider the most common ABox reasoning services for the description logic $\dlssx$ ($\shdlssx$, for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment \flqsr. $\shdlssx$ is a very expressive description logic admitting various concept and role constructs, datatypes, and it allows one to represent rule based languages such as SWRL. Decidability results are achieved by defining a generalized version of the…
1 Citations

## Figures and Tables from this paper

### A Set-Theoretic Approach to ABox Reasoning Services

• Computer Science, Mathematics
RuleML+RR
• 2017
This paper considers the most common ABox reasoning services for the description logic (D) and proves their decidability via a reduction to the satisfiability problem for the set-theoretic fragment.

## References

SHOWING 1-10 OF 29 REFERENCES

### Conjunctive Query Answering via a Fragment of Set Theory

• Computer Science
ICTCS
• 2016
The CQA problem for $\shdlssx$ is solved through a decision procedure for the satisfiability problem of $\flqsr$ and a space based procedure is defined for the same problem, more suitable for implementation purposes, and its computational complexity is analyzed.

### Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach

• Computer Science
AAAI
• 2007
Decidability (more precisely, a 2EXPTIME upper bound) of query answering is proved, thus significantly pushing the decidability frontier, both with respect to the query language and the considered DL.

### Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ

• Computer Science
IJCAI
• 2011
These are the first completeness results for query answering in DLs with inverses, nominals, and counting, and show that for the considered logics the problem is not more expensive than standard reasoning.

### Reasoning with Individuals for the Description Logic SHIQ

• Computer Science
• 2000
An algorithm for combined Tbox and Abox reasoning in the $$\mathcal{SHIQ}$$ description logic is presented, of particular interest as it can be used to decide the problem of (database) conjunctive query containment w.r.t. a schema.

### The Even More Irresistible SROIQ

• Computer Science
KR
• 2006
A rather elegant tableau-based reasoning algorithm that combines the use of automata to keep track of universal value restrictions with the techniques developed for SHOIQ, which has been adopted as the logical basis for the next iteration of OWL, OWL 1.1.

### A Set-Theoretic Approach to ABox Reasoning Services

• Computer Science, Mathematics
RuleML+RR
• 2017
This paper considers the most common ABox reasoning services for the description logic (D) and proves their decidability via a reduction to the satisfiability problem for the set-theoretic fragment.

### Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics

• Computer Science
AAAI
• 2006
For a whole range of DLs from AL to SHIQ, answering CQs with no transitive roles has CONP-complete data complexity, established by a novel tableaux-based algorithm for checking query entailment.

### A Conjunctive Query Language for Description Logic Aboxes

• Computer Science
AAAI/IAAI
• 2000
This paper presents a novel technique that can be used to provide an expressive query language for interrogating the knowledge base of Description Logic systems, based on a reduction to knowledge base satisfiability.