TY - JOUR
T1 - Complexity results for probabilistic answer set programming
AU - Mauá, Denis Deratani
AU - Cozman, Fabio Gagliardi
N1 - Funding Information:
The first author received financial support by the Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), grants 303920/2016-5 (PQ) and 420669/2016-7 . The second author is partially supported by the CNPq grant 312180/2018-7 (PQ). This work has been supported in part by the Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP), grants 2015/21880-4 , 2016/18841-0 , 2019/07665-4 , and in part by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) – finance code 001 .
PY - 2020/3/1
Y1 - 2020/3/1
N2 - We analyze the computational complexity of probabilistic logic programming with constraints, disjunctive heads, and aggregates such as sum and max. We consider propositional programs and relational programs with bounded-arity predicates, and look at cautious reasoning (i.e., computing the smallest probability of an atom over all probability models), cautious explanation (i.e., finding an interpretation that maximizes the lower probability of evidence) and cautious maximum-a-posteriori (i.e., finding a partial interpretation for a set of atoms that maximizes their lower probability conditional on evidence) under Lukasiewicz's credal semantics.
AB - We analyze the computational complexity of probabilistic logic programming with constraints, disjunctive heads, and aggregates such as sum and max. We consider propositional programs and relational programs with bounded-arity predicates, and look at cautious reasoning (i.e., computing the smallest probability of an atom over all probability models), cautious explanation (i.e., finding an interpretation that maximizes the lower probability of evidence) and cautious maximum-a-posteriori (i.e., finding a partial interpretation for a set of atoms that maximizes their lower probability conditional on evidence) under Lukasiewicz's credal semantics.
KW - Answer set programming
KW - Computational complexity
KW - Probabilistic logic programming
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85077376075&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=85077376075&origin=inward
UR - http://www.scopus.com/inward/record.url?scp=85077376075&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/86702dc2-8eba-39ec-952a-533f5b3d3bbb/
U2 - 10.1016/j.ijar.2019.12.003
DO - 10.1016/j.ijar.2019.12.003
M3 - Article
VL - 118
SP - 133
EP - 154
JO - International Journal of Approximate Reasoning
JF - International Journal of Approximate Reasoning
SN - 0888-613X
ER -