# Probabilistic Reasoning in the Description Logic ALCP with the Principle of Maximum Entropy (Full Version)

arXiv: https://arxiv.org/abs/1606.09521 · HTML: https://mlsanity.com/paper/1606.09521/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Jun 2016.

## Built on by (most cited first, 1 of 1)

- [Approximating Probabilistic Inference in Statistical EL with Knowledge Graph Embeddings](https://mlsanity.com/paper/2407.11821/) (2024)

## Abstract (arXiv)

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.
