Maximum entropy calculations for the probabilistic description logic \(\mathcal{ALC}^{\mathsf{ME}}\)

DOI10.1007/978-3-030-22102-7_28zbMath1444.68193OpenAlexW2953738224MaRDI QIDQ2185493

Marco Wilhelm, Gabriele Kern-Isberner

Publication date: 4 June 2020

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

zbMATH Keywords

principle of maximum entropyprobabilistic description logicsaggregating semanticspolynomial-time optimizationtyped model counting

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (2)

A reconstruction of multipreference closure ⋮ Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure

This page was built for publication: Maximum entropy calculations for the probabilistic description logic \(\mathcal{ALC}^{\mathsf{ME}}\)