Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/BRACIS.2013.38 | Intelligent Systems |
Keywords | Field | DocType |
mixed integer programming,probabilistic assertion,nested probabilistic formula,normal form,generalized probabilistic satisfiability,paper study,phase-transition phenomenon,boolean combination,probabilistic satisfiability problem,gpsat problem,integer programming,computability,probability | Inductive programming,Boolean satisfiability problem,Probabilistic CTL,Algorithm,Probabilistic analysis of algorithms,Integer programming,Linear programming,Probabilistic logic,Probabilistic argumentation,Mathematics | Conference |
Citations | PageRank | References |
1 | 0.36 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Glauber de Bona | 1 | 31 | 6.59 |
| Fábio G. Cozman | 2 | 26 | 3.45 |
| Marcelo Finger | 3 | 365 | 48.82 |