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

June 30, 2016 Β· Declared Dead Β· πŸ› Scalable Uncertainty Management

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Rafael PeΓ±aloza, Nico Potyka arXiv ID 1606.09521 Category cs.AI: Artificial Intelligence Cross-listed cs.LO Citations 2 Venue Scalable Uncertainty Management Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted