Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases
<|reference_start|>Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases: 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.<|reference_end|>
@article{bienvenu2024cost-based,
    title={Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases},
    author={Meghyn Bienvenu, Camille Bourgaux, Robin Jean},
    journal={arXiv preprint arXiv:2407.20754},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.20754},
    primaryClass={cs.LO cs.AI cs.DB}
}