A linear programming approach to reasoning about probabilities
From MaRDI portal
Publication:1356219
DOI10.1007/BF01531078zbMath0878.68034OpenAlexW2054971774MaRDI QIDQ1356219
Dimitris J. Kavvadias, Christos H. Papadimitriou
Publication date: 14 December 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01531078
Related Items
Projection, consistency, and George Boole, Characterizing consistency in probabilistic logic for a class of Horn clauses, A column generation approach to job grouping for flexible manufacturing systems, Boole's conditions of possible experience and reasoning under uncertainty, A further step for efficient corrections of inconsistent probabilistic data sets, Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics, Mass Customization and “Forecasting Options’ Penetration Rates Problem”, Best second order bounds for two-terminal network reliability with dependent edge failures, Consistency checking and querying in probabilistic databases under integrity constraints, Quantitative Logic Reasoning, Towards classifying propositional probabilistic logics, An anytime deduction algorithm for the probabilistic logic and entailment problems, Merging the local and global approaches to probabilistic satisfiability, Automated non-monotonic reasoning in System \textbf{P}, Reasoning with Uncertainty in Deductive Databases and Logic Programs, Polynomially Computable Bounds for the Probability of the Union of Events, Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem, On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees, New methods for computing inferences in first order logic, Probabilistic satisfiability with imprecise probabilities, Logics with Probability Operators, Combining probabilistic logic programming with the power of maximum entropy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic logic
- Probabilistic satisfiability
- Some simplified NP-complete graph problems
- Decomposition Principle for Linear Programs
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- A practicable steepest-edge simplex algorithm
- An Efficient Heuristic Procedure for Partitioning Graphs
- Fuzzy sets
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
