Probabilistic satisfiability and coherence checking through integer programming
DOI10.1016/J.IJAR.2014.09.002zbMATH Open1328.68193OpenAlexW2079457832MaRDI 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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finitely additive conditional probabilities, conglomerability and disintegrations
- Stochastic independence in a coherent setting
- Coherent numerical and ordinal probabilistic assessments
- Introduction to Imprecise Probabilities
- Representation of conditional probability measures on Boolean algebras
- Notes on conditional previsions
- Probabilistic logic
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory
- Merging the local and global approaches to probabilistic satisfiability
- On confirmation and rational betting
- Column Generation Methods for Probabilistic Logic
- A Hybrid Method for Probabilistic Satisfiability
- A survey of the theory of coherent lower previsions
- Finitely additive conditional probabilities
- Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
- The role of coherence in eliciting and handling imprecise probabilities and its application to medical diagnosis
- A logic for reasoning about probabilities
- Probabilistic logic programming
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Sets of desirable gambles: conditioning, representation, and precise probabilities
- Anytime deduction for probabilistic logic
- Probabilistic logic under coherence: complexity and algorithms
- Expressive probabilistic description logics
- 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
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Locally strong coherence and inference with lower-upper probabilities
- The CONEstrip Algorithm
- Probabilistic satisfiability
- Easy cases of probabilistic satisfiability
- Probabilistic satisfiability
- Logic and integer programming
- A Propositional CONEstrip Algorithm
- The Smith-Walley interpretation of subjective probability: an appreciation
Cited In (5)
- Compatibility, desirability, and the running intersection property
- Title not available (Why is that?)
- Modeling agent's conditional preferences under objective ambiguity in Dempster-Shafer theory
- A further step for efficient corrections of inconsistent probabilistic data sets
- 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)