Probabilistic satisfiability and coherence checking through integer programming
From MaRDI portal
Publication:2344365
DOI10.1016/j.ijar.2014.09.002zbMath1328.68193MaRDI QIDQ2344365
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
integer programming; coherence; phase transitions; probabilistic logic; probabilistic satisfiability
90C10: Integer programming
68T37: Reasoning under uncertainty in the context of artificial intelligence
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
A further step for efficient corrections of inconsistent probabilistic data sets, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, Compatibility, desirability, and the running intersection property, Modeling agent's conditional preferences under objective ambiguity in Dempster-Shafer theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sets of desirable gambles: conditioning, representation, and precise probabilities
- Probabilistic logic under coherence: complexity and algorithms
- Notes on conditional previsions
- Logic and integer programming
- Probabilistic logic
- Probabilistic satisfiability
- Probabilistic logic programming
- Finitely additive conditional probabilities, conglomerability and disintegrations
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory
- Anytime deduction for probabilistic logic
- Simplification rules for the coherent probability assessment problem
- On the linear structure of betting criterion and the checking of coherence
- Locally strong coherence in inference processes
- Stochastic independence in a coherent setting
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- Locally strong coherence and inference with lower-upper probabilities
- A logic for reasoning about probabilities
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Merging the local and global approaches to probabilistic satisfiability
- A survey of the theory of coherent lower previsions
- Easy cases of probabilistic satisfiability
- Expressive probabilistic description logics
- The Smith-Walley interpretation of subjective probability: an appreciation
- The CONEstrip Algorithm
- On confirmation and rational betting
- Finitely additive conditional probabilities
- Column Generation Methods for Probabilistic Logic
- Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
- A Hybrid Method for Probabilistic Satisfiability
- A Propositional CONEstrip Algorithm
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Coherent numerical and ordinal probabilistic assessments
- Introduction to Imprecise Probabilities
- Representation of conditional probability measures on Boolean algebras
- The role of coherence in eliciting and handling imprecise probabilities and its application to medical diagnosis
