A linear programming approach to reasoning about probabilities
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- A practicable steepest-edge simplex algorithm
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Decomposition Principle for Linear Programs
- Fuzzy sets
- Probabilistic logic
- Probabilistic satisfiability
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Some simplified NP-complete graph problems
Cited in
(31)- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- Projection, consistency, and George Boole
- An anytime deduction algorithm for the probabilistic logic and entailment problems
- Easy cases of probabilistic satisfiability
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
- Probabilistic Models for Linear Programming
- Boole's conditions of possible experience and reasoning under uncertainty
- Towards classifying propositional probabilistic logics
- A column generation approach to job grouping for flexible manufacturing systems
- Assignment methods for incidence calculus
- scientific article; zbMATH DE number 5957368 (Why is no real title available?)
- Best second order bounds for two-terminal network reliability with dependent edge failures
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
- On consistency in probabilistic logic for logical formulas represented by B-hypertrees
- A note on the infeasibility of some inference processes
- Reasoning with uncertainty in deductive databases and logic programs
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- New methods for computing inferences in first order logic
- Polynomially computable bounds for the probability of the union of events
- Merging the local and global approaches to probabilistic satisfiability
- Automated non-monotonic reasoning in System \textbf{P}
- Logics with Probability Operators
- Quantitative logic reasoning
- A further step for efficient corrections of inconsistent probabilistic data sets
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- Probable consistency checking for sets of propositional clauses
- Probabilistic satisfiability with imprecise probabilities
- Mass customization and ``forecasting options' penetration rates problem
- Combining probabilistic logic programming with the power of maximum entropy
- Probabilistic satisfiability
- Consistency checking and querying in probabilistic databases under integrity constraints
This page was built for publication: A linear programming approach to reasoning about probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356219)
