Why not? Developing ABox Abduction beyond Repairs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918107211104256 |
|---|---|
| author | Haak, Anselm Koopmann, Patrick Mahmood, Yasir Turhan, Anni-Yasmin |
| author_facet | Haak, Anselm Koopmann, Patrick Mahmood, Yasir Turhan, Anni-Yasmin |
| contents | Abduction is the task of computing a sufficient extension of a knowledge base (KB) that entails a conclusion not entailed by the original KB. It serves to compute explanations, or hypotheses, for such missing entailments. While this task has been intensively investigated for perfect data and under classical semantics, less is known about abduction when erroneous data results in inconsistent KBs. In this paper we define a suitable notion of abduction under repair semantics, and propose a set of minimality criteria that guides abduction towards `useful' hypotheses. We provide initial complexity results on deciding existence of and verifying abductive solutions with these criteria, under different repair semantics and for the description logics DL-Lite and EL_bot. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_21955 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Why not? Developing ABox Abduction beyond Repairs Haak, Anselm Koopmann, Patrick Mahmood, Yasir Turhan, Anni-Yasmin Logic in Computer Science Abduction is the task of computing a sufficient extension of a knowledge base (KB) that entails a conclusion not entailed by the original KB. It serves to compute explanations, or hypotheses, for such missing entailments. While this task has been intensively investigated for perfect data and under classical semantics, less is known about abduction when erroneous data results in inconsistent KBs. In this paper we define a suitable notion of abduction under repair semantics, and propose a set of minimality criteria that guides abduction towards `useful' hypotheses. We provide initial complexity results on deciding existence of and verifying abductive solutions with these criteria, under different repair semantics and for the description logics DL-Lite and EL_bot. |
| title | Why not? Developing ABox Abduction beyond Repairs |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2507.21955 |