Extending EL^++ with linear constraints on the probability of axioms

DOI10.1007/978-3-030-22102-7_13MaRDI QIDQ2185471zbMATH OpenOpenAlexFDO

Authors Marcelo Finger

Publication date 4 June 2020

Full work available at URL https://doi.org/10.1007/978-3-030-22102-7_13

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\)
• Probabilistic description logics for subjective uncertainty
• Expressive probabilistic description logics
• Towards Statistical Reasoning in Description Logics over Finite Domains
• Instance-Based Non-standard Inferences in $\mathcal{EL}$ with Subjective Probabilities

Cited in

(4)

• Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete
• The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\)
• Completion-based generalization inferences for the description logic \(\mathcal{ELOR}\) with subjective probabilities
• Acquisition of Terminological Knowledge in Probabilistic Description Logic

This page was built for publication: Extending \(\mathcal{EL}^{++}\) with linear constraints on the probability of axioms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185471)