Name
Abstract | ||
|---|---|---|
This paper presents a study of the relationship between probabilistic reasoning and deductive reasoning, in propositional format. We propose an algorithm to solve probabilistic satisfiability (PSAT) based on the study of its logical properties. Each iteration of the algorithm generates in polynomial time a classical (non-probabilistic) formula that is submitted to a SAT-oracle. This strategy is a Turing reduction of PSAT into SAT. We demonstrate the correctness and termination of the algorithm. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-16952-6_46 | IBERAMIA |
Keywords | Field | DocType |
probabilistic satisfiability,deductive reasoning,propositional format,polynomial time,turing reduction,probabilistic reasoning,logical property,satisfiability | Correctness,Satisfiability,Probabilistic CTL,Algorithm,Probabilistic analysis of algorithms,Theoretical computer science,Deductive reasoning,Probabilistic argumentation,Probabilistic logic,Propositional formula,Mathematics | Conference |
Volume | ISSN | ISBN |
6433 | 0302-9743 | 3-642-16951-1 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcelo Finger | 1 | 365 | 48.82 |
| Glauber de Bona | 2 | 31 | 6.59 |