Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
From MaRDI portal
(Redirected from Publication:905995)
Recommendations
Cites work
- scientific article; zbMATH DE number 5838699 (Why is no real title available?)
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 3514748 (Why is no real title available?)
- scientific article; zbMATH DE number 3607492 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 480237 (Why is no real title available?)
- A hybrid method for probabilistic satisfiability
- A linear programming approach to reasoning about probabilities
- A linear-time transformation of linear inequalities into conjunctive normal form
- Algorithms for the maximum satisfiability problem
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
- Classical recursion theory. The theory of functions and sets of natural numbers
- Column Generation Methods for Probabilistic Logic
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Easy cases of probabilistic satisfiability
- Exploiting Cycle Structures in Max-SAT
- Inequalities. A journey into linear analysis
- Lazy satisfiability modulo theories
- Merging the local and global approaches to probabilistic satisfiability
- Probabilistic logic
- Probabilistic logic revisited
- Probabilistic satisfiability
- Probabilistic satisfiability
- Probabilistic satisfiability and coherence checking through integer programming
- Probabilistic satisfiability with imprecise probabilities
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- Probability logic
- Probability logic and optimization SAT: The PSAT and CPA models
- Simplification rules for the coherent probability assessment problem
- Solutions for hard and soft constraints using optimized probabilistic satisfiability
- Stochastic independence in a coherent setting
- The complexity of theorem-proving procedures
- The consistency of the CADIAG-2 knowledge base: a probabilistic approach
- The many facets of linear programming
- Theory and Applications of Satisfiability Testing
- Understanding a Probabilistic Description Logic via Connections to First-Order Logic of Probability
Cited in
(9)- Probabilistic sentence satisfiability: an approach to PSAT
- Quantitative logic reasoning
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
- 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
- Phase transitions of EXPSPACE-complete problems
- Generalized probabilistic satisfiability
- Phase transitions of PP-complete satisfiability problems
- Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem
This page was built for publication: Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905995)
