Pages that link to "Item:Q1356219"
From MaRDI portal
The following pages link to A linear programming approach to reasoning about probabilities (Q1356219):
Displaying 30 items.
- Projection, consistency, and George Boole (Q265702) (← links)
- Combining probabilistic logic programming with the power of maximum entropy (Q814608) (← links)
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation (Q899162) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- An anytime deduction algorithm for the probabilistic logic and entailment problems (Q962834) (← links)
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (Q1296804) (← links)
- On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees (Q1296806) (← links)
- New methods for computing inferences in first order logic (Q1309900) (← links)
- Characterizing consistency in probabilistic logic for a class of Horn clauses (Q1340063) (← links)
- A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
- Assignment methods for incidence calculus (Q1344260) (← links)
- Probabilistic satisfiability with imprecise probabilities (Q1605686) (← links)
- Boole's conditions of possible experience and reasoning under uncertainty (Q1894361) (← links)
- Best second order bounds for two-terminal network reliability with dependent edge failures (Q1961463) (← links)
- Automated non-monotonic reasoning in System \textbf{P} (Q2043430) (← links)
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics (Q2209555) (← links)
- Towards classifying propositional probabilistic logics (Q2250552) (← links)
- Merging the local and global approaches to probabilistic satisfiability (Q2270380) (← links)
- Consistency checking and querying in probabilistic databases under integrity constraints (Q2453564) (← links)
- Probabilistic satisfiability (Q2752129) (← links)
- (Q3093394) (← links)
- Reasoning with Uncertainty in Deductive Databases and Logic Programs (Q3114490) (← links)
- Quantitative Logic Reasoning (Q3305344) (← links)
- Probabilistic Models for Linear Programming (Q3989814) (← links)
- Logics with Probability Operators (Q5024712) (← links)
- Mass Customization and “Forecasting Options’ Penetration Rates Problem” (Q5129183) (← links)
- Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
- A note on the infeasibility of some inference processes (Q5748884) (← links)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty (Q5900650) (← links)
- A further step for efficient corrections of inconsistent probabilistic data sets (Q6116537) (← links)