BDBComp
Parceria:
SBC
The Well-Founded Semantics of Cyclic Probabilistic Logic Programs: Meaning and Complexity

Fabio Gagliardi CozmanDenis Deratani Mauá

This paper investigates the properties of cyclic probabilistic normallogic programs, consisting of rules and a set of independent probabilistic facts,under the well-founded semantics. That is, we assume that for each fixed truthassignment for the probabilistic facts, the resulting normal logic program isinterpreted through the well-founded semantics. We derive results concerningthe complexity of inference, and discuss the challenging interplay between three-valued assignments and probabilities.

http://www.lbd.dcc.ufmg.br/colecoes/eniac/2016/014.pdf

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD