Complexity analysis and variational inference for interpretation-based probabilistic description logics

Fabio Gagliardi Cozman; Rodrigo Bellizia Polastro

Complexity analysis and variational inference for interpretation-based probabilistic description logics

Fabio Gagliardi Cozman, Rodrigo Bellizia Polastro

Resultado de la investigación: Contribución a una conferencia › Artículo de conferencia

20 Citas (Scopus)

Resumen

This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies. Inference is shown to be PEXP-complete, and variational methods are designed so as to exploit logical inference whenever possible.

Idioma original	Inglés estadounidense
Páginas	117-125
Número de páginas	9
Estado	Publicada - 1 dic 2009
Publicado de forma externa	Sí
Evento	Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009 - Duración: 1 dic 2009 → …

Conferencia

Conferencia	Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009
Período	1/12/09 → …

Acceder al documento

Citar esto

Cozman, F. G., & Polastro, R. B. (2009). Complexity analysis and variational inference for interpretation-based probabilistic description logics. 117-125. Papel presentado en Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009, .

@conference{c34a6bb6ff9543279b4ff365b7190523,

title = "Complexity analysis and variational inference for interpretation-based probabilistic description logics",

abstract = "This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies. Inference is shown to be PEXP-complete, and variational methods are designed so as to exploit logical inference whenever possible.",

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

year = "2009",

month = dec,

day = "1",

language = "American English",

pages = "117--125",

note = "Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009 ; Conference date: 01-12-2009",

}

Complexity analysis and variational inference for interpretation-based probabilistic description logics. / Cozman, Fabio Gagliardi; Polastro, Rodrigo Bellizia.

2009. 117-125 Papel presentado en Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009, .

Resultado de la investigación: Contribución a una conferencia › Artículo de conferencia

TY - CONF

T1 - Complexity analysis and variational inference for interpretation-based probabilistic description logics

AU - Cozman, Fabio Gagliardi

AU - Polastro, Rodrigo Bellizia

PY - 2009/12/1

Y1 - 2009/12/1

N2 - This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies. Inference is shown to be PEXP-complete, and variational methods are designed so as to exploit logical inference whenever possible.

AB - This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies. Inference is shown to be PEXP-complete, and variational methods are designed so as to exploit logical inference whenever possible.

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

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

M3 - Conference Paper

SP - 117

EP - 125

T2 - Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Y2 - 1 December 2009

ER -