Probabilistic satisfiability and coherence checking through integer programming

Fabio Gagliardi Cozman, Lucas Fargoni Di Ianni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Abstract

This paper presents algorithms based on integer programming, both for probabilistic satisfiability and coherence checking. That is, we consider probabilistic assessments for both standard probability measures (Kolmogorovian setup) and full conditional measures (de Finettian coherence setup), and in both cases verify satisfiability/coherence using integer programming. We present empirical evaluation of our method, with evidence of phase-transitions. © 2013 Springer-Verlag Berlin Heidelberg.
Original languageAmerican English
Title of host publicationProbabilistic satisfiability and coherence checking through integer programming
Pages145-156
Number of pages12
ISBN (Electronic)9783642390906
DOIs
StatePublished - 1 Aug 2013
Externally publishedYes
EventLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duration: 1 Jan 2018 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7958 LNAI
ISSN (Print)0302-9743

Conference

ConferenceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Period1/01/18 → …

Fingerprint

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

Cite this