Title :
Generalized Probabilistic Satisfiability
Author :
de Bona, Glauber ; Cozman, Fabio G. ; Finger, M.
Author_Institution :
Inst. de Mat. e Estatistica, Univ. de Sao Paulo, Sao Paulo, Brazil
Abstract :
This paper studies the Generalized Probabilistic Satisfiability (GPSAT) problem, where the probabilistic satisfiability problem is extended by allowing Boolean combinations of probabilistic assertions and nested probabilistic formulas. We introduce a normal form for this problem and show that nesting of probabilities does not increase the expressivity in GPSAT. An algorithm to solve GPSAT problems via mixed integer programming is proposed, and its implementation shows evidence of phase-transition phenomena.
Keywords :
computability; integer programming; probability; Boolean combinations; GPSAT problem; generalized probabilistic satisfiability; mixed integer programming; nested probabilistic formulas; phase-transition phenomenon; probabilistic assertions; Bismuth; Electronic mail; Fingers; Linear programming; Polynomials; Probabilistic logic; Semantics;
Conference_Titel :
Intelligent Systems (BRACIS), 2013 Brazilian Conference on
Conference_Location :
Fortaleza
DOI :
10.1109/BRACIS.2013.38
