The following pages link to Probabilistic satisfiability (Q1104751):
Displaying 50 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 approach to the satisfiability problem (Q808705) (← 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)
- 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)
- 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)
- Generalized probabilistic satisfiability (Q1744442) (← links)
- Probability logic and optimization SAT: The PSAT and CPA models (Q1777404) (← links)
- The complexity of satisfiability in non-iterated and iterated probabilistic logics (Q1783740) (← links)
- Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking (Q1783933) (← links)
- Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic (Q1799080) (← 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)
- Compatibility, desirability, and the running intersection property (Q1989412) (← 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)
- Deciding Koopman's qualitative probability (Q2238703) (← links)
- Towards classifying propositional probabilistic logics (Q2250552) (← links)
- Merging the local and global approaches to probabilistic satisfiability (Q2270380) (← links)
- The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
- Probabilistic sentence satisfiability: an approach to PSAT (Q2287193) (← links)
- A polynomial-time fragment of epistemic probabilistic argumentation (Q2302822) (← links)
- Probabilistic satisfiability and coherence checking through integer programming (Q2344365) (← links)
- Refinement-oriented probability for CSP (Q2365393) (← 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)
- Inconsistency-tolerant reasoning over linear probabilistic knowledge bases (Q2411265) (← links)
- Levels of uniformity (Q2418784) (← links)
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities (Q2424888) (← links)
- Balanced matrices (Q2433704) (← links)
- Consistency checking and querying in probabilistic databases under integrity constraints (Q2453564) (← links)
- Aggregating disparate estimates of chance (Q2466865) (← links)
- Itemset frequency satisfiability: complexity and axiomatization (Q2481978) (← links)
- Safe projections of binary data sets (Q2491217) (← links)
- The differential of probabilistic entailment (Q2662693) (← links)