REVIEW 1 cited by
The Probabilistic Description Logic $\mathcal{BALC}$
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for representing and handling uncertainty. A probabilistic extension of a light-weight DL was recently proposed for dealing with certain knowledge occurring in uncertain contexts. In this paper, we continue that line of research by introducing the Bayesian extension \BALC of the propositionally closed DL \ALC. We present a tableau-based procedure for deciding consistency, and adapt it to solve other probabilistic, contextual, and general inferences in this logic. We also show that all these problems remain \ExpTime-complete, the same as reasoning in the underlying classical \ALC.
Forward citations
Cited by 1 Pith paper
-
T-CPDL: A Temporal Causal Probabilistic Description Logic for Developing Logic-RAG Agent
T-CPDL combines temporal, causal, and probabilistic operators into a Description Logic intended to support logic-enhanced RAG, but the preprint supplies only a syntax sketch and unverified theorems.
Discussion (0). Sign in to comment.