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

06/30/2016
by   Rafael Penaloza, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2017

Towards Statistical Reasoning in Description Logics over Finite Domains (Full Version)

We present a probabilistic extension of the description logic ALC for re...
research
09/28/2020

The Probabilistic Description Logic ℬ𝒜ℒ𝒞

Description logics (DLs) are well-known knowledge representation formali...
research
05/05/2014

Reasoning with Probabilistic Logics

The interest in the combination of probability with logics for modeling ...
research
03/27/2013

Implementing Probabilistic Reasoning

General problems in analyzing information in a probabilistic database ar...
research
08/21/2022

Tyche: A library for probabilistic reasoning and belief modelling in Python

This paper presents Tyche, a Python library to facilitate probabilistic ...
research
08/27/2019

Extending Description Logic EL++ with Linear Constraints on the Probability of Axioms

One of the main reasons to employ a description logic such as EL or EL++...
research
03/27/2013

An Inequality Paradigm for Probabilistic Knowledge

We propose an inequality paradigm for probabilistic reasoning based on a...

Please sign up or login with your details

Forgot password? Click here to reset