Loopy propagation in a probabilistic description logic

Fabio Gagliardi Cozman, Rodrigo Bellizia Polastro

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

This paper introduces a probabilistic description logic that adds probabilistic inclusions to the popular logic ALC, and derives inference algorithms for inference in the logic. The probabilistic logic, referred to as crALC ("credal" ALC), combines the usual acyclicity condition with a Markov condition; in this context, inference is equated with calculation of (bounds on) posterior probability in relational credal/Bayesian networks. As exact inference does not seem scalable due to the presence of quantifiers, we present first-order loopy propagation methods that seem to behave appropriately for non-trivial domain sizes. © 2008 Springer-Verlag.
Original languageAmerican English
Title of host publicationLoopy propagation in a probabilistic description logic
Pages120-133
Number of pages14
ISBN (Electronic)3540879927, 9783540879923
DOIs
StatePublished - 1 Dec 2008
Externally publishedYes
EventLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duration: 1 Jan 2018 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5291 LNAI
ISSN (Print)0302-9743

Conference

ConferenceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Period1/01/18 → …

Fingerprint

Dive into the research topics of 'Loopy propagation in a probabilistic description logic'. Together they form a unique fingerprint.

Cite this