# Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases

arXiv: https://arxiv.org/abs/2407.20754 · HTML: https://mlsanity.com/paper/2407.20754/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 5 of its 34 references that are in the map.
- First posted on arXiv 30 Jul 2024.

## Builds on (most cited first, 5 of 5)

- [Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics (extended version)](https://mlsanity.com/paper/1605.07159/) (2016)
- [Axiom Pinpointing](https://mlsanity.com/paper/2003.08298/) (2020)
- [Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints](https://mlsanity.com/paper/2002.06072/) (2020)
- [Database Repairing with Soft Functional Dependencies](https://mlsanity.com/paper/2009.13821/) (2020)
- [Querying Circumscribed Description Logic Knowledge Bases](https://mlsanity.com/paper/2306.04546/) (2023)

## Built on by (most cited first, 2 of 2)

- [Data Complexity of Querying Description Logic Knowledge Bases under Cost-Based Semantics](https://mlsanity.com/paper/2511.07095/) (2025)
- [Semantic Bridges Between First Order c-Representations and Cost-Based Semantics: An Initial Perspective](https://mlsanity.com/paper/2510.00817/) (2025)

## Abstract (arXiv)

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.