Loopy propagation in a probabilistic description logic

Fabio Gagliardi Cozman; Rodrigo Bellizia Polastro

doi:10.1007/978-3-540-87993-0_11

Loopy propagation in a probabilistic description logic

Fabio Gagliardi Cozman, Rodrigo Bellizia Polastro

Resultado de la investigación: Capítulo del libro/informe/acta de congreso › Contribución a la conferencia

12 Citas (Scopus)

Resumen

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.

Idioma original	Inglés estadounidense
Título de la publicación alojada	Loopy propagation in a probabilistic description logic
Páginas	120-133
Número de páginas	14
ISBN (versión digital)	3540879927, 9783540879923
DOI	https://doi.org/10.1007/978-3-540-87993-0_11
Estado	Publicada - 1 dic 2008
Publicado de forma externa	Sí
Evento	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - Duración: 1 ene 2018 → …

Serie de la publicación

Nombre	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen	5291 LNAI
ISSN (versión impresa)	0302-9743

Conferencia

Conferencia	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Período	1/01/18 → …

Acceder al documento

10.1007/978-3-540-87993-0_11

Huella Profundice en los temas de investigación de 'Loopy propagation in a probabilistic description logic'. En conjunto forman una huella única.

Citar esto

Cozman, F. G., & Polastro, R. B. (2008). Loopy propagation in a probabilistic description logic. En Loopy propagation in a probabilistic description logic (pp. 120-133). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5291 LNAI). https://doi.org/10.1007/978-3-540-87993-0_11

@inproceedings{0585ab62b46e46638dea205e75ea2ca5,

title = "Loopy propagation in a probabilistic description logic",

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. {\textcopyright} 2008 Springer-Verlag.",

author = "Cozman, {Fabio Gagliardi} and Polastro, {Rodrigo Bellizia}",

year = "2008",

month = dec,

day = "1",

doi = "10.1007/978-3-540-87993-0_11",

language = "American English",

isbn = "3540879927",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "120--133",

booktitle = "Loopy propagation in a probabilistic description logic",

note = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Conference date: 01-01-2018",

}

Cozman, FG & Polastro, RB 2008, Loopy propagation in a probabilistic description logic. En Loopy propagation in a probabilistic description logic. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5291 LNAI, pp. 120-133, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1/01/18. https://doi.org/10.1007/978-3-540-87993-0_11

Loopy propagation in a probabilistic description logic. / Cozman, Fabio Gagliardi; Polastro, Rodrigo Bellizia.

Loopy propagation in a probabilistic description logic. 2008. p. 120-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5291 LNAI).

Resultado de la investigación: Capítulo del libro/informe/acta de congreso › Contribución a la conferencia

TY - GEN

T1 - Loopy propagation in a probabilistic description logic

AU - Cozman, Fabio Gagliardi

AU - Polastro, Rodrigo Bellizia

PY - 2008/12/1

Y1 - 2008/12/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=77049110363&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=77049110363&origin=inward

U2 - 10.1007/978-3-540-87993-0_11

DO - 10.1007/978-3-540-87993-0_11

M3 - Conference contribution

SN - 3540879927

SN - 9783540879923

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 120

EP - 133

BT - Loopy propagation in a probabilistic description logic

T2 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Y2 - 1 January 2018

ER -