Probabilistic satisfiability and coherence checking through integer programming

Fabio G. Cozman, Lucas Fargoni Di Ianni

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

© 2014 Elsevier Inc. This paper presents algorithms, both for probabilistic satisfiability and for coherence checking, that rely on reduction to integer programming. That is, we verify whether probabilistic assessments can be satisfied by standard probability measures (Kolmogorovian setting) or by full conditional probabilities (de Finettian coherence setting), and in both cases verify satisfiability or coherence using integer programming techniques. We present an empirical evaluation of our method, the results of which show evidence of phase transitions.
Original languageAmerican English
Pages (from-to)57-70
Number of pages14
JournalInternational Journal of Approximate Reasoning
DOIs
StatePublished - 1 Jan 2015
Externally publishedYes

Fingerprint

Dive into the research topics of 'Probabilistic satisfiability and coherence checking through integer programming'. Together they form a unique fingerprint.

Cite this