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. © 2013 IEEE.
|Original language||American English|
|Number of pages||7|
|State||Published - 1 Jan 2013|
|Event||Proceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013 - |
Duration: 1 Jan 2013 → …
|Conference||Proceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013|
|Period||1/01/13 → …|