Title :
Probabilistic Answer Set Programming
Author :
Menezes de Morais, Eduardo ; Finger, M.
Author_Institution :
Dept. of Comput. Sci., Univ. of Sao Paulo, Sao Paulo, Brazil
Abstract :
This paper introduces a technique called Probabilistic Answer Set Programming (PASP), that allows modeling complex theories and checking its satisfiability with respect to a set of probabilistic data. We propose an algorithm for PASP processing based on a Turing reduction method to ASP.
Keywords :
Turing machines; computability; logic programming; probabilistic logic; PASP processing; Turing reduction method; complex theory; probabilistic answer set programming; probabilistic data; satisfiability; Biological system modeling; Computational modeling; Probabilistic logic; Probability distribution; Programming; Semantics; Vectors; answer set programming (ASP); logic programming; probabilistic logic; probabilistic satisfiability (PSAT);
Conference_Titel :
Intelligent Systems (BRACIS), 2013 Brazilian Conference on
Conference_Location :
Fortaleza
DOI :
10.1109/BRACIS.2013.33
