Probabilistic satisfiability: algorithms with the presence and absence of a phase transition

DOI10.1007/s10472-015-9466-6zbMath1347.68331OpenAlexW2212155158WikidataQ117021971 ScholiaQ117021971MaRDI QIDQ905995

Glauber De Bona, Marcelo Finger

Publication date: 28 January 2016

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-015-9466-6

zbMATH Keywords

phase transitionprobabilistic satisfiabilityPSAT

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

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 ⋮ Quantitative Logic Reasoning ⋮ Generalized probabilistic satisfiability ⋮ Probabilistic sentence satisfiability: an approach to PSAT

Uses Software

• MiniSat
• z3
• Chaff
• MSUnCore
• Pronto

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time transformation of linear inequalities into conjunctive normal form
• Algorithms for the maximum satisfiability problem
• Probability logic
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
• Probabilistic logic
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• Probabilistic satisfiability
• Classical recursion theory. The theory of functions and sets of natural numbers
• A linear programming approach to reasoning about probabilities
• Simplification rules for the coherent probability assessment problem
• Stochastic independence in a coherent setting
• Probabilistic satisfiability with imprecise probabilities
• Probability logic and optimization SAT: The PSAT and CPA models
• The many facets of linear programming
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• Merging the local and global approaches to probabilistic satisfiability
• Probabilistic satisfiability and coherence checking through integer programming
• Easy cases of probabilistic satisfiability
• Probabilistic logic revisited
• Exploiting Cycle Structures in Max-SAT
• Column Generation Methods for Probabilistic Logic
• The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach
• A Hybrid Method for Probabilistic Satisfiability
• Theory and Applications of Satisfiability Testing
• Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability
• Understanding a Probabilistic Description Logic via Connections to First-Order Logic of Probability
• The complexity of theorem-proving procedures

This page was built for publication: Probabilistic satisfiability: algorithms with the presence and absence of a phase transition