Generalized probabilistic satisfiability
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mixed integer programming (90C11) Stochastic programming (90C15)
Recommendations
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
- Probabilistic satisfiability
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- Easy cases of probabilistic satisfiability
- Artificial Intelligence and Soft Computing - ICAISC 2004
Cites work
- A logic for reasoning about probabilities
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1324220 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- Probabilistic logic
- Probabilistic satisfiability
- Probabilistic satisfiability and coherence checking through integer programming
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- The complexity of theorem-proving procedures
- The Monty Hall problem. The remarkable story of math's most contentious brain teaser.
Cited in
(16)- Probabilistic satisfiability
- Probability logic and optimization SAT: The PSAT and CPA models
- Probabilistic sentence satisfiability: an approach to PSAT
- Probabilistic satisfiability and coherence checking through integer programming
- Easy cases of probabilistic satisfiability
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
- GenPSAT
- scientific article; zbMATH DE number 69384 (Why is no real title available?)
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
- A hybrid method for probabilistic satisfiability
- Probabilistic logic over equations and domain restrictions
- Mathematical Foundations of Computer Science 2003
- The satisfiability problem for probabilistic ordered branching programs
- Optimization and probabilistic satisfiability on nested and co-nested formulas
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
This page was built for publication: Generalized probabilistic satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744442)