The joy of Probabilistic Answer Set Programming: Semantics, complexity, expressivity, inference

Fabio Gagliardi Cozman, Denis Deratani Mauá

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

5 Citas (Scopus)

Resumen

Probabilistic Answer Set Programming (PASP) combines rules, facts, and independent probabilistic facts. We argue that a very useful modeling paradigm is obtained by adopting a particular semantics for PASP, where one associates a credal set with each consistent program. We examine the basic properties of PASP under this credal semantics, in particular presenting novel results on its complexity and its expressivity, and we introduce an inference algorithm to compute (upper) probabilities given a program.

Idioma originalInglés
Páginas (desde-hasta)218-239
Número de páginas22
PublicaciónInternational Journal of Approximate Reasoning
Volumen125
DOI
EstadoPublicada - oct 2020
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'The joy of Probabilistic Answer Set Programming: Semantics, complexity, expressivity, inference'. En conjunto forman una huella única.

Citar esto