A Practical Acyclicity Notion for Query Answering over Horn-SRIQ Ontologies

April 19, 2018 ยท The Ethereal ยท ๐Ÿ› International Workshop on the Semantic Web

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors David Carral, Cristina Feier, Pascal Hitzler arXiv ID 1804.07274 Category cs.LO: Logic in CS Cross-listed cs.AI, cs.DB Citations 8 Venue International Workshop on the Semantic Web Last Checked 5 months ago
Abstract
Conjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the chase algorithm. In this paper, we define a novel acyclicity notion which provides a sufficient condition for termination of the restricted chase over Horn-SRIQ TBoxes. We show that this notion generalizes most of the existing acyclicity conditions (both theoretically and empirically). Furthermore, this new acyclicity notion gives rise to a very efficient reasoning procedure. We provide evidence for this by providing a materialization based reasoner for acyclic ontologies which outperforms other state-of-the-art systems.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS