BIBLIOS

   Ciências References Management System

Visitor Mode (Login)
Need help?


Back

Publication details

Document type
Journal articles

Document subtype
Full paper

Title
Generalized Probabilistic Satisfiability

Participants in the publication
Carlos Caleiro (Author)
Filipe Casal (Author)
Dep. Informática
 LASIGE
 Andreia Mordido (Author)
Dep. Informática
 LASIGE
Summary
We analyze a generalized probabilistic satisfiability problem (GenPSAT) which consists in deciding the satisfiability of linear inequalities involving probabilities of classical propositional formulas. GenPSAT is proved to be NP-complete and we present a polynomial reduction to Mixed-Integer Programming. Capitalizing on this translation, we implement and test a solver for the GenPSAT problem. As previously observed for many other NP-complete problems, we are able to detect a phase transition behaviour for GenPSAT.

Date of Publication
2017-06

Where published
Electronic Notes in Theoretical Computer Science

Publication Identifiers
ISSN - 1571-0661

Publisher
Elsevier BV

Volume
332

Number of pages
17
Starting page
39
Last page
56

Document Identifiers
DOI - https://doi.org/10.1016/j.entcs.2017.04.004
URL - http://dx.doi.org/10.1016/j.entcs.2017.04.004

Rankings
SCIMAGO Q2 (2016) - 0.261 - Computer Science (miscellaneous)

Keywords
Probabilistic Satisfiability GenPSAT Mixed-Integer Programming Phase Transition


Export

APA
Carlos Caleiro, Filipe Casal, Andreia Mordido, (2017). Generalized Probabilistic Satisfiability. Electronic Notes in Theoretical Computer Science, 332, 39-56. ISSN 1571-0661. eISSN . http://dx.doi.org/10.1016/j.entcs.2017.04.004

IEEE
Carlos Caleiro, Filipe Casal, Andreia Mordido, "Generalized Probabilistic Satisfiability" in Electronic Notes in Theoretical Computer Science, vol. 332, pp. 39-56, 2017. 10.1016/j.entcs.2017.04.004

BIBTEX
@article{35843, author = {Carlos Caleiro and Filipe Casal and Andreia Mordido}, title = {Generalized Probabilistic Satisfiability}, journal = {Electronic Notes in Theoretical Computer Science}, year = 2017, pages = {39-56}, volume = 332 }