On the entailment problem for DL-Lite$_{core}$ ontologies and conjunctive queries with negation
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914132139180032 |
|---|---|
| author | Marcinkowski, Jerzy Ostropolski-Nalewaja, Piotr |
| author_facet | Marcinkowski, Jerzy Ostropolski-Nalewaja, Piotr |
| contents | We show that the entailment problem, for a given entailment problem for DL-Lite$_{core}$ ontology, and given conjunctive query with inequalities, is undecidable.
We also show that this problem remains undecidable if conjunctive queries with safe negation are considered instead of conjunctive queries with inequalities. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_23490 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the entailment problem for DL-Lite$_{core}$ ontologies and conjunctive queries with negation Marcinkowski, Jerzy Ostropolski-Nalewaja, Piotr Logic in Computer Science We show that the entailment problem, for a given entailment problem for DL-Lite$_{core}$ ontology, and given conjunctive query with inequalities, is undecidable. We also show that this problem remains undecidable if conjunctive queries with safe negation are considered instead of conjunctive queries with inequalities. |
| title | On the entailment problem for DL-Lite$_{core}$ ontologies and conjunctive queries with negation |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2510.23490 |