Semantics and Inference for Probabilistic Description Logics

Author(s):  
Riccardo Zese ◽  
Elena Bellodi ◽  
Evelina Lamma ◽  
Fabrizio Riguzzi ◽  
Fabiano Aguiari
Algorithms ◽  
2021 ◽  
Vol 14 (10) ◽  
pp. 280
Author(s):  
Rafael Peñaloza

Logic-based knowledge representation is one of the main building blocks of (logic-based) artificial intelligence. While most successful knowledge representation languages are based on classical logic, realistic intelligent applications need to handle uncertainty in an adequate manner. Over the years, many different languages for representing uncertain knowledge—often extensions of classical knowledge representation languages—have been proposed. We briefly present some of the defining properties of these languages as they pertain to the family of probabilistic description logics. This limited view is intended to help pave the way for the interested researcher to find the most adequate language for their needs, and potentially identify the remaining gaps.


2017 ◽  
Vol 58 ◽  
pp. 1-66 ◽  
Author(s):  
Victor Gutierrez-Basulto ◽  
Jean Christoph Jung ◽  
Carsten Lutz ◽  
Lutz Schröder

We propose a family of probabilistic description logics (DLs) that are derived in a principled way from Halpern's probabilistic first-order logic. The resulting probabilistic DLs have a two-dimensional semantics similar to temporal DLs and are well-suited for representing subjective probabilities. We carry out a detailed study of reasoning in the new family of logics, concentrating on probabilistic extensions of the DLs ALC and EL, and showing that the complexity ranges from PTime via ExpTime and 2ExpTime to undecidable.


Author(s):  
LEONARD BOTHA ◽  
THOMAS MEYER ◽  
RAFAEL PEÑALOZA

Abstract Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for representing and handling uncertainty. A probabilistic extension of a light-weight DL was recently proposed for dealing with certain knowledge occurring in uncertain contexts. In this paper, we continue that line of research by introducing the Bayesian extension of the propositionally closed DL . We present a tableau-based procedure for deciding consistency and adapt it to solve other probabilistic, contextual, and general inferences in this logic. We also show that all these problems remain ExpTime-complete, the same as reasoning in the underlying classical .


Author(s):  
Giuseppe Cota ◽  
Fabrizio Riguzzi ◽  
Riccardo Zese ◽  
Elena Bellodi ◽  
Evelina Lamma

Semantic Web ◽  
2015 ◽  
Vol 6 (5) ◽  
pp. 477-501 ◽  
Author(s):  
Fabrizio Riguzzi ◽  
Elena Bellodi ◽  
Evelina Lamma ◽  
Riccardo Zese

Author(s):  
José Eduardo Ochoa-Luna ◽  
Kate Revoredo ◽  
Fábio Gagliardi Cozman

Sign in / Sign up

Export Citation Format

Share Document