Probabilistic reasoning in the description logic ALCP with the principle of maximum entropy

From MaRDI portal
Publication:5268422

DOI10.1007/978-3-319-45856-4_17zbMATH Open1366.68293arXiv1606.09521OpenAlexW2509327789MaRDI QIDQ5268422FDOQ5268422


Authors: Rafael Peñaloza, Nico Potyka Edit this on Wikidata


Publication date: 20 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: A central question for knowledge representation is how to encode and handle uncertain knowledge adequately. We introduce the probabilistic description logic ALCP that is designed for representing context-dependent knowledge, where the actual context taking place is uncertain. ALCP allows the expression of logical dependencies on the domain and probabilistic dependencies on the possible contexts. In order to draw probabilistic conclusions, we employ the principle of maximum entropy. We provide reasoning algorithms for this logic, and show that it satisfies several desirable properties of probabilistic logics.


Full work available at URL: https://arxiv.org/abs/1606.09521




Recommendations



Cites Work


Cited In (4)





This page was built for publication: Probabilistic reasoning in the description logic \(\mathcal {ALCP}\) with the principle of maximum entropy

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