Generalized probabilistic satisfiability

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

doi:10.1109/BRACIS.2013.38

Generalized probabilistic satisfiability

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

Research output: Contribution to conference › Conference 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 language	American English
Pages	182-188
Number of pages	7
DOIs	https://doi.org/10.1109/BRACIS.2013.38
State	Published - 1 Jan 2013
Externally published	Yes
Event	Proceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013 - Duration: 1 Jan 2013 → …

Conference

Conference	Proceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013
Period	1/01/13 → …

Access to Document

10.1109/BRACIS.2013.38

Cite this

@conference{0f821fceb1194583a1c3fe6acc04e688,

title = "Generalized probabilistic satisfiability",

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. {\textcopyright} 2013 IEEE.",

author = "{De Bona}, Glauber and Cozman, {F{\'a}bio G.} and Marcelo Finger",

year = "2013",

month = jan,

day = "1",

doi = "10.1109/BRACIS.2013.38",

language = "American English",

pages = "182--188",

note = "Proceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013 ; Conference date: 01-01-2013",

}

TY - CONF

T1 - Generalized probabilistic satisfiability

AU - De Bona, Glauber

AU - Cozman, Fábio G.

AU - Finger, Marcelo

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84894167701&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84894167701&origin=inward

U2 - 10.1109/BRACIS.2013.38

DO - 10.1109/BRACIS.2013.38

M3 - Conference Paper

SP - 182

EP - 188

T2 - Proceedings - 2013 Brazilian Conference on Intelligent Systems, BRACIS 2013

Y2 - 1 January 2013

ER -

Generalized probabilistic satisfiability

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this