The paper presents a method for querying inconsistent Description Logics (DL) knowledge bases using a probabilistic semantics called DISPONTE. The key points are:
The DISPONTE semantics associates probability values with axioms in the knowledge base, allowing reasoning to be performed even when the knowledge base is inconsistent.
The authors describe extensions to the tableau algorithm used in DL reasoners to collect justifications for both the query and the inconsistency of the knowledge base. This allows the probability of the query to be computed correctly.
The proposed approach is compared to the repair semantics, which is one of the most established ways of handling inconsistent knowledge bases. The authors show how their reasoning workflow can be adapted to also answer queries under different repair semantics.
The authors have implemented their approach in two different DL reasoners, TRILL and BUNDLE, demonstrating its feasibility and ease of implementation.
The probabilistic reasoning allows the identification of axioms that are likely to be incorrect and can be removed to debug the knowledge base. This is done by associating probability values strictly less than 1.0 to axioms.
Overall, the paper presents a novel approach for querying inconsistent probabilistic knowledge bases, with implementations and comparisons to existing techniques.
Başka Bir Dile
kaynak içeriğinden
arxiv.org
Önemli Bilgiler Şuradan Elde Edildi
by Riccardo Zes... : arxiv.org 09-11-2024
https://arxiv.org/pdf/2306.09138.pdfDaha Derin Sorular