Probabilistic satisfiability with imprecise probabilities
From MaRDI portal
Publication:1605686
DOI10.1016/S0888-613X(00)00033-5zbMath0995.68122OpenAlexW2046090861MaRDI QIDQ1605686
Fabien Chauny, Pierre Hansen, Brigitte Jaumard, Sylvain Perron, Marcus V. Poggi de Aragão
Publication date: 23 July 2002
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0888-613x(00)00033-5
Stochastic programming (90C15) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (12)
Coherence graphs ⋮ Conformity and independence with coherent lower previsions ⋮ A Dempster-Shafer model of imprecise assertion strategies ⋮ Imprecise probabilistic models based on hierarchical intervals ⋮ Probabilistic satisfiability: algorithms with the presence and absence of a phase transition ⋮ Mass Customization and “Forecasting Options’ Penetration Rates Problem” ⋮ Compatibility, desirability, and the running intersection property ⋮ Probabilistic abduction without priors ⋮ Probability logic and optimization SAT: The PSAT and CPA models ⋮ A Propositional CONEstrip Algorithm ⋮ Evaluating the Uncertainty of a Boolean Formula with Belief Functions ⋮ Computing posterior upper expectations
Uses Software
Cites Work
- Coherent qualitative probability
- Probabilistic logic
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
- Probabilistic satisfiability
- On the uncertainties transmitted from premises to conclusions in deductive inferences
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
- Comparative probability for conditional events: A new look through coherence
- A linear programming approach to reasoning about probabilities
- A logic for reasoning about probabilities
- Boole's conditions of possible experience and reasoning under uncertainty
- The basic algorithm for pseudo-Boolean programming revisited
- CHARACTERIZATION OF COHERENT CONDITIONAL PROBABILITIES AS A TOOL FOR THEIR ASSESSMENT AND EXTENSION
- Column Generation Methods for Probabilistic Logic
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Programming with linear fractional functionals
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Conditional events in probability assessment and revision
- Coherent numerical and ordinal probabilistic assessments
- On Nonlinear Fractional Programming
- 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
This page was built for publication: Probabilistic satisfiability with imprecise probabilities