Generalized probabilistic satisfiability

Glauber De Bona, Fábio G. Cozman, Marcelo Finger

Research output: Contribution to conferenceConference Paper

1 Scopus citations

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. © 2013 IEEE.
Original languageAmerican English
Pages182-188
Number of pages7
DOIs
StatePublished - 1 Jan 2013
Externally publishedYes
EventProceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013 -
Duration: 1 Jan 2013 → …

Conference

ConferenceProceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013
Period1/01/13 → …

Fingerprint

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

Cite this