2000 character limit reached
Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases
Published 30 Jul 2024 in cs.LO, cs.AI, and cs.DB | (2407.20754v2)
Abstract: 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.
- 2024. What does a query answer tell you? Informativeness of query answers for knowledge bases. In Proceedings of AAAI.
- 2022. Pushing optimal ABox repair from ℰℒℰℒ\mathcal{EL}caligraphic_E caligraphic_L towards more expressive Horn-DLs. In Proceedings of KR.
- 2020. Satisfiability and query answering in description logics with global and local cardinality constraints. In Proceedings of ECAI.
- 2017. An Introduction to Description Logic. Cambridge University Press.
- 2019. Worst-case optimal querying of very expressive description logics with path expressions and succinct counting. In Proceedings of IJCAI.
- 2016. Inconsistency-tolerant querying of description logic knowledge bases. In Reasoning Web, Tutorial Lectures.
- 2015. Ontology-mediated query answering with data-tractable description logics. In Reasoning Web.
- 2013. Tractable approximations of consistent query answering for robust ontology-based data access. In Proceedings of IJCAI.
- 2014. Querying inconsistent description logic knowledge bases under preferred repair semantics. In Proceedings of AAAI.
- 2022. Counting queries over ℰℒℋℐ⊥ℰℒℋsubscriptℐbottom\mathcal{ELHI}_{\bot}caligraphic_E caligraphic_L caligraphic_H caligraphic_I start_POSTSUBSCRIPT ⊥ end_POSTSUBSCRIPT ontologies. In Proceedings of KR.
- Bienvenu, M. 2020. A short survey on inconsistency handling in ontology-mediated query answering. Künstliche Intell. 34(4):443–451.
- 2009. The complexity of circumscription in DLs. J. Artif. Intell. Res. 35:717–773.
- Bourgaux, C. 2016. Inconsistency handling in ontology-mediated query answering. (Gestion des incohérences pour l’accès aux données en présence d’ontologies). Ph.D. Dissertation, University of Paris-Saclay, France.
- 2021. Principles of KLM-style defeasible description logics. ACM Trans. Comput. Log. 22(1):1:1–1:46.
- 2009. Regular path queries in expressive description logics with nominals. In Proceedings of IJCAI.
- 2021. Database repairing with soft functional dependencies. In Proceedings of ICDT.
- 2016. Generalized consistent query answering under existential rules. In Proceedings of KR.
- 2013. A non-monotonic description logic for reasoning about typicality. Artif. Intell. 195:165–202.
- Krentel, M. W. 1988. The complexity of optimization problems. J. Comput. Syst. Sci. 36(3):490–509.
- 2010. Inconsistency-tolerant semantics for description logics. In Proceedings of RR.
- 2007. Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics. In Proceedings of ICDT.
- 2016. Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics (extended version). CoRR abs/1605.07159.
- 2019. Complexity of inconsistency-tolerant query answering in Datalog+/– under cardinality-based repairs. Proceedings of AAAI.
- 2023. Querying circumscribed description logic knowledge bases. In Proceedings of KR.
- Manière, Q. 2022. Counting queries in ontology-based data access. (Requêtes de comptage pour l’accès aux données en présence d’ontologies). Ph.D. Dissertation, University of Bordeaux, France.
- 2016. Closed predicates in description logics: Results on combined complexity. In Proceedings of KR.
- 2012. Reasoning and query answering in description logics. In Reasoning Web.
- 2005. Debugging OWL ontologies. In Proceedings of WWW.
- Peñaloza, R. 2020. Axiom pinpointing. In Applications and Practices in Ontology Design, Extraction, and Reasoning, volume 49 of Studies on the Semantic Web. IOS Press. 162–177.
- 2008. Linking data to ontologies. Journal of Data Semantics 10:133–173.
- Schaerf, A. 1993. On the complexity of the instance checking problem in concept languages with existential quantification. J. Intell. Inf. Syst. 2(3):265–278.
- Tobies, S. 2000. The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. Artif. Intell. Res. 12:199–217.
- 2018. Ontology-based data access: A survey. In Proceedings of IJCAI.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.