Name
Abstract | ||
|---|---|---|
This paper studies the generalized probabilistic satisfiability (GPSAT) problem, where the probabilistic satisfiability (PSAT) problem is extended by allowing Boolean combinations of probabilistic assertions and nested probabilistic formulas. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1186/s13173-015-0028-x | J. Braz. Comp. Soc. |
Keywords | Field | DocType |
Probabilistic logic, Probabilistic satisfiability, Mixed integer linear programming | Data structure,Computer science,Satisfiability,Algorithm,Probabilistic CTL,Probabilistic analysis of algorithms,Theoretical computer science,Integer programming,Probabilistic logic | Journal |
Volume | Issue | ISSN |
21 | 1 | 1678-4804 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Glauber de Bona | 1 | 31 | 6.59 |
| Fábio Cozman | 2 | 18 | 10.16 |
| Marcelo Finger | 3 | 365 | 48.82 |