Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.09206 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912231016366080 |
|---|---|
| author | Qureshi, Haya Majid Faber, Wolfgang |
| author_facet | Qureshi, Haya Majid Faber, Wolfgang |
| contents | Metamodeling refers to scenarios in ontologies in which classes and roles can be members of classes or occur in roles. This is a desirable modelling feature in several applications, but allowing it without restrictions is problematic for several reasons, mainly because it causes undecidability. Therefore, practical languages either forbid metamodeling explicitly or treat occurrences of classes as instances to be semantically different from other occurrences, thereby not allowing metamodeling semantically. Several extensions have been proposed to provide metamodeling to some extent. Building on earlier work that reduces metamodeling query answering to Datalog query answering, recently reductions to query answering over hybrid knowledge bases were proposed with the aim of using the Datalog transformation only where necessary. Preliminary work showed that the approach works, but the hoped-for performance improvements were not observed yet. In this work we expand on this body of work by improving the theoretical basis of the reductions and by using alternative tools that show competitive performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_09206 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient OWL2QL Meta-reasoning Using ASP-based Hybrid Knowledge Bases Qureshi, Haya Majid Faber, Wolfgang Logic in Computer Science Artificial Intelligence Symbolic Computation Metamodeling refers to scenarios in ontologies in which classes and roles can be members of classes or occur in roles. This is a desirable modelling feature in several applications, but allowing it without restrictions is problematic for several reasons, mainly because it causes undecidability. Therefore, practical languages either forbid metamodeling explicitly or treat occurrences of classes as instances to be semantically different from other occurrences, thereby not allowing metamodeling semantically. Several extensions have been proposed to provide metamodeling to some extent. Building on earlier work that reduces metamodeling query answering to Datalog query answering, recently reductions to query answering over hybrid knowledge bases were proposed with the aim of using the Datalog transformation only where necessary. Preliminary work showed that the approach works, but the hoped-for performance improvements were not observed yet. In this work we expand on this body of work by improving the theoretical basis of the reductions and by using alternative tools that show competitive performance. |
| title | Efficient OWL2QL Meta-reasoning Using ASP-based Hybrid Knowledge Bases |
| topic | Logic in Computer Science Artificial Intelligence Symbolic Computation |
| url | https://arxiv.org/abs/2502.09206 |