The following pages link to Probabilistic satisfiability (Q1104751):
Displayed 30 items.
- Algorithms for possibility assessments: coherence and extension (Q533175) (← links)
- Sequential decision making with partially ordered preferences (Q646545) (← links)
- Optimization and probabilistic satisfiability on nested and co-nested formulas (Q646722) (← links)
- Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
- Computational complexity of queries based on itemsets (Q844194) (← links)
- NP-containment for the coherence test of assessments of conditional probability: a fuzzy logical approach (Q877263) (← links)
- An anytime deduction algorithm for the probabilistic logic and entailment problems (Q962834) (← links)
- The theory of interval probabilistic logic programs (Q1039578) (← links)
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (Q1296804) (← 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)
- Resolution and the integrality of satisfiability problems (Q1352293) (← links)
- A linear programming approach to reasoning about probabilities (Q1356219) (← links)
- Probabilistic satisfiability with imprecise probabilities (Q1605686) (← links)
- Probability logic and optimization SAT: The PSAT and CPA models (Q1777404) (← links)
- A logic for reasoning about probabilities (Q1813497) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Axiomatization of frequent itemsets (Q1853610) (← 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)
- Merging the local and global approaches to probabilistic satisfiability (Q2270380) (← links)
- The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
- Probabilistic logic with independence (Q2379311) (← links)
- Expressive probabilistic description logics (Q2389639) (← links)
- Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence (Q2390651) (← links)
- Balanced matrices (Q2433704) (← links)
- Aggregating disparate estimates of chance (Q2466865) (← links)
- Itemset frequency satisfiability: complexity and axiomatization (Q2481978) (← links)
- Safe projections of binary data sets (Q2491217) (← links)
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics (Q5387294) (← links)