On Finite Entailment of Non-Local Queries in Description Logics

June 30, 2020 Β· Declared Dead Β· πŸ› International Conference on Principles of Knowledge Representation and Reasoning

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tomasz Gogacz, Víctor Gutiérrez-Basulto, Albert Gutowski, Yazmín IbÑñez-García, Filip Murlak arXiv ID 2006.16869 Category cs.AI: Artificial Intelligence Cross-listed cs.DB Citations 5 Venue International Conference on Principles of Knowledge Representation and Reasoning Last Checked 4 months ago
Abstract
We study the problem of finite entailment of ontology-mediated queries. Going beyond local queries, we allow transitive closure over roles. We focus on ontologies formulated in the description logics ALCOI and ALCOQ, extended with transitive closure. For both logics, we show 2EXPTIME upper bounds for finite entailment of unions of conjunctive queries with transitive closure. We also provide a matching lower bound by showing that finite entailment of conjunctive queries with transitive closure in ALC is 2EXPTIME-hard.
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 β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted