Generalized probabilistic satisfiability through integer programming

Glauber De Bona, Fabio G. Cozman, Marcelo Finger

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

© 2015, De Bona et al. Background: 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. Methods: We introduce a normal form for this problem and show that both nesting of probabilities and multi-agent probabilities do not increase the expressivity of GPSAT. An algorithm to solve GPSAT instances in the normal form via mixed integer linear programming is proposed. Results: The implementation of the algorithm is used to explore the complexity profile of GPSAT, and it shows evidence of phase-transition phenomena. Conclusions: Even though GPSAT is considerably more expressive than PSAT, it can be handled using integer linear programming techniques.
Original languageAmerican English
JournalJournal of the Brazilian Computer Society
DOIs
StatePublished - 29 Dec 2015
Externally publishedYes

Fingerprint Dive into the research topics of 'Generalized probabilistic satisfiability through integer programming'. Together they form a unique fingerprint.

Cite this