Probabilistic satisfiability and coherence checking through integer programming

DOI10.1016/J.IJAR.2014.09.002MaRDI QIDQ2344365zbMATH OpenOpenAlexFDO

Authors Fabio G. Cozman, Lucas Fargoni di Ianni

Publication date 15 May 2015

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2014.09.002

zbMATH Keywords

coherenceinteger programmingphase transitionsprobabilistic logicprobabilistic satisfiability

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37) Integer programming (90C10)

Recommendations

• Probabilistic satisfiability and coherence checking through integer programming
• Probabilistic satisfiability
• Algorithms for possibility assessments: coherence and extension
• Probabilistic satisfiability with imprecise probabilities
• Generalized probabilistic satisfiability

Cites work

• A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
• A hybrid method for probabilistic satisfiability
• A logic for reasoning about probabilities
• A propositional CONEstrip algorithm
• A survey of the theory of coherent lower previsions
• Anytime deduction for probabilistic logic
• Best Possible Inequalities for the Probability of a Logical Function of Events
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory
• Coherent numerical and ordinal probabilistic assessments
• Column Generation Methods for Probabilistic Logic
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• Easy cases of probabilistic satisfiability
• Expressive probabilistic description logics
• Finitely additive conditional probabilities
• Finitely additive conditional probabilities, conglomerability and disintegrations
• scientific article; zbMATH DE number 3137579 (Why is no real title available?)
• scientific article; zbMATH DE number 3936060 (Why is no real title available?)
• scientific article; zbMATH DE number 3688363 (Why is no real title available?)
• scientific article; zbMATH DE number 46364 (Why is no real title available?)
• scientific article; zbMATH DE number 48344 (Why is no real title available?)
• scientific article; zbMATH DE number 49749 (Why is no real title available?)
• scientific article; zbMATH DE number 1324220 (Why is no real title available?)
• scientific article; zbMATH DE number 1014107 (Why is no real title available?)
• scientific article; zbMATH DE number 2046116 (Why is no real title available?)
• scientific article; zbMATH DE number 1762478 (Why is no real title available?)
• scientific article; zbMATH DE number 1844478 (Why is no real title available?)
• scientific article; zbMATH DE number 3216701 (Why is no real title available?)
• scientific article; zbMATH DE number 956599 (Why is no real title available?)
• Introduction to imprecise probabilities
• Locally strong coherence and inference with lower-upper probabilities
• Locally strong coherence in inference processes
• Logic and integer programming
• Merging the local and global approaches to probabilistic satisfiability
• Notes on conditional previsions
• On confirmation and rational betting
• On the linear structure of betting criterion and the checking of coherence
• Probabilistic logic
• Probabilistic logic programming
• Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
• Probabilistic logic under coherence: complexity and algorithms
• Probabilistic satisfiability
• Probabilistic satisfiability
• Representation of conditional probability measures on Boolean algebras
• Sets of desirable gambles: conditioning, representation, and precise probabilities
• Simplification rules for the coherent probability assessment problem
• Stochastic independence in a coherent setting
• The CONEstrip algorithm
• The formulation and solution of discrete optimisation models
• The role of coherence in eliciting and handling imprecise probabilities and its application to medical diagnosis
• The Smith-Walley interpretation of subjective probability: an appreciation

Cited in

(8)

• Compatibility, desirability, and the running intersection property
• Merging the local and global approaches to probabilistic satisfiability
• Modeling agent's conditional preferences under objective ambiguity in Dempster-Shafer theory
• scientific article; zbMATH DE number 1335882 (Why is no real title available?)
• Probabilistic satisfiability and coherence checking through integer programming
• A further step for efficient corrections of inconsistent probabilistic data sets
• De Finetti's legacy in dealing with uncertainty: towards finance, artificial intelligence and beyond
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition

This page was built for publication: Probabilistic satisfiability and coherence checking through integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344365)