Counting strategies for the probabilistic description logic ALC^ME under the principle of maximum entropy

DOI10.1007/978-3-030-19570-0_28MaRDI QIDQ2296725zbMATH OpenOpenAlexFDO

Authors Marco Wilhelm, Gabriele Kern-Isberner, Andreas Ecke, Franz Baader

Publication date 18 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-19570-0_28

zbMATH Keywords

aggregating semanticsdomain-lifted inferenceprinciple of maximum entropyprobabilistic description logics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Maximum entropy calculations for the probabilistic description logic \(\mathcal{ALC}^{\mathsf{ME}}\)
• The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\)
• Probabilistic reasoning in the description logic \(\mathcal {ALCP}\) with the principle of maximum entropy
• Towards Statistical Reasoning in Description Logics over Finite Domains
• Probabilistic description logics for subjective uncertainty

Cited in

(1)

• Entropy and monotonicity in artificial intelligence

This page was built for publication: Counting strategies for the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\) under the principle of maximum entropy

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