Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929443860119552 |
|---|---|
| author | Bienvenu, Meghyn Bourgaux, Camille Jean, Robin |
| author_facet | Bienvenu, Meghyn Bourgaux, Camille Jean, Robin |
| contents | In this paper, we explore a quantitative approach to querying inconsistent description logic knowledge bases. We consider weighted knowledge bases in which both axioms and assertions have (possibly infinite) weights, which are used to assign a cost to each interpretation based upon the axioms and assertions it violates. Two notions of certain and possible answer are defined by either considering interpretations whose cost does not exceed a given bound or restricting attention to optimal-cost interpretations. Our main contribution is a comprehensive analysis of the combined and data complexity of bounded cost satisfiability and certain and possible answer recognition, for description logics between ELbot and ALCO. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_20754 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases Bienvenu, Meghyn Bourgaux, Camille Jean, Robin Logic in Computer Science Artificial Intelligence Databases In this paper, we explore a quantitative approach to querying inconsistent description logic knowledge bases. We consider weighted knowledge bases in which both axioms and assertions have (possibly infinite) weights, which are used to assign a cost to each interpretation based upon the axioms and assertions it violates. Two notions of certain and possible answer are defined by either considering interpretations whose cost does not exceed a given bound or restricting attention to optimal-cost interpretations. Our main contribution is a comprehensive analysis of the combined and data complexity of bounded cost satisfiability and certain and possible answer recognition, for description logics between ELbot and ALCO. |
| title | Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases |
| topic | Logic in Computer Science Artificial Intelligence Databases |
| url | https://arxiv.org/abs/2407.20754 |