Evaluating Datalog Tools for Meta-reasoning over OWL 2 QL
Guardat en:
| Publicat a: | arXiv.org (Feb 5, 2024), p. n/a |
|---|---|
| Autor principal: | |
| Altres autors: | |
| Publicat: |
Cornell University Library, arXiv.org
|
| Matèries: | |
| Accés en línia: | Citation/Abstract Full text outside of ProQuest |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2922667397 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2922667397 | ||
| 045 | 0 | |b d20240205 | |
| 100 | 1 | |a Qureshi, Haya Majid | |
| 245 | 1 | |a Evaluating Datalog Tools for Meta-reasoning over OWL 2 QL | |
| 260 | |b Cornell University Library, arXiv.org |c Feb 5, 2024 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a Metamodeling is a general approach to expressing knowledge about classes and properties in an ontology. It is a desirable modeling feature in multiple applications that simplifies the extension and reuse of ontologies. Nevertheless, allowing metamodeling without restrictions is problematic for several reasons, mainly due to undecidability issues. Practical languages, therefore, forbid classes to occur as instances of other classes or treat such occurrences as semantically different objects. Specifically, meta-querying in SPARQL under the Direct Semantic Entailment Regime (DSER) uses the latter approach, thereby effectively not supporting meta-queries. However, several extensions enabling different metamodeling features have been proposed over the last decade. This paper deals with the Metamodeling Semantics (MS) over OWL 2 QL and the Metamodeling Semantic Entailment Regime (MSER), as proposed in Lenzerini et al. (2015) and Lenzerini et al. (2020); Cima et al. (2017). A reduction from OWL 2 QL to Datalog for meta-querying was proposed in Cima et al. (2017). In this paper, we experiment with various logic programming tools that support Datalog querying to determine their suitability as back-ends to MSER query answering. These tools stem from different logic programming paradigms (Prolog, pure Datalog, Answer Set Programming, Hybrid Knowledge Bases). Our work shows that the Datalog approach to MSER querying is practical also for sizeable ontologies with limited resources (time and memory). This paper significantly extends Qureshi & Faber (2021) by a more detailed experimental analysis and more background. Under consideration in Theory and Practice of Logic Programming (TPLP). | |
| 653 | |a Logic programming | ||
| 653 | |a Declarative programming | ||
| 653 | |a Semantics | ||
| 653 | |a Knowledge bases (artificial intelligence) | ||
| 653 | |a Ontology | ||
| 653 | |a Mathematical programming | ||
| 653 | |a Metamodels | ||
| 653 | |a Tools | ||
| 700 | 1 | |a Faber, Wolfgang | |
| 773 | 0 | |t arXiv.org |g (Feb 5, 2024), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2922667397/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/2402.02978 |