Probabilistic Reasoning by SAT Solvers

Author(s):  
Emad Saad
Author(s):  
Shubham Sharma ◽  
Subhajit Roy ◽  
Mate Soos ◽  
Kuldeep S. Meel

Given a Boolean formula F, the problem of model counting, also referred to as #SAT, seeks to compute the number of solutions of F. Model counting is a fundamental problem with a wide variety of applications ranging from planning, quantified information flow to probabilistic reasoning and the like. The modern #SAT solvers tend to be either based on static decomposition, dynamic decomposition, or a hybrid of the two. Despite dynamic decomposition based #SAT solvers sharing much of their architecture with SAT solvers, the core design and heuristics of dynamic decomposition-based #SAT solvers has remained constant for over a decade. In this paper, we revisit the architecture of the state-of-the-art dynamic decomposition-based #SAT tool, sharpSAT, and demonstrate that by introducing a new notion of probabilistic component caching and the usage of universal hashing for exact model counting along with the development of several new heuristics can lead to significant performance improvement over state-of-the-art model-counters. In particular, we develop GANAK, a new scalable probabilistic exact model counter that outperforms state-of-the-art exact and approximate model counters sharpSAT and ApproxMC3 respectively, both in terms of PAR-2 score and the number of instances solved. Furthermore, in our experiments, the model count returned by GANAK was equal to the exact model count for all the benchmarks. Finally, we observe that recently proposed preprocessing techniques for model counting benefit exact model counters while hurting the performance of approximate model counters.


Author(s):  
PAUL A. BOXER

Autonomous robots are unsuccessful at operating in complex, unconstrained environments. They lack the ability to learn about the physical behavior of different objects through the use of vision. We combine Bayesian networks and qualitative spatial representation to learn general physical behavior by visual observation. We input training scenarios that allow the system to observe and learn normal physical behavior. The position and velocity of the visible objects are represented as qualitative states. Transitions between these states over time are entered as evidence into a Bayesian network. The network provides probabilities of future transitions to produce predictions of future physical behavior. We use test scenarios to determine how well the approach discriminates between normal and abnormal physical behavior and actively predicts future behavior. We examine the ability of the system to learn three naive physical concepts, "no action at a distance", "solidity" and "movement on continuous paths". We conclude that the combination of qualitative spatial representations and Bayesian network techniques is capable of learning these three rules of naive physics.


Author(s):  
Paul Christoph Gembarski ◽  
Stefan Plappert ◽  
Roland Lachmayer

AbstractMaking design decisions is characterized by a high degree of uncertainty, especially in the early phase of the product development process, when little information is known, while the decisions made have an impact on the entire product life cycle. Therefore, the goal of complexity management is to reduce uncertainty in order to minimize or avoid the need for design changes in a late phase of product development or in the use phase. With our approach we model the uncertainties with probabilistic reasoning in a Bayesian decision network explicitly, as the uncertainties are directly attached to parts of the design artifact′s model. By modeling the incomplete information expressed by unobserved variables in the Bayesian network in terms of probabilities, as well as the variation of product properties or parameters, a conclusion about the robustness of the product can be made. The application example of a rotary valve from engineering design shows that the decision network can support the engineer in decision-making under uncertainty. Furthermore, a contribution to knowledge formalization in the development project is made.


2021 ◽  
Vol 63 (12) ◽  
pp. 2178-2188
Author(s):  
A. Yu. Маtrosova ◽  
V. А. Provkin ◽  
V. Z. Tychinskiy ◽  
Е. А. Nikolaeva ◽  
G. G. Goshin
Keyword(s):  

2011 ◽  
Vol 42 (3) ◽  
pp. 270-276 ◽  
Author(s):  
Hannah E. Reese ◽  
Richard J. McNally ◽  
Sabine Wilhelm

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Sichao Yang ◽  
Johannes Bill ◽  
Jan Drugowitsch ◽  
Samuel J. Gershman

AbstractMotion relations in visual scenes carry an abundance of behaviorally relevant information, but little is known about how humans identify the structure underlying a scene’s motion in the first place. We studied the computations governing human motion structure identification in two psychophysics experiments and found that perception of motion relations showed hallmarks of Bayesian structural inference. At the heart of our research lies a tractable task design that enabled us to reveal the signatures of probabilistic reasoning about latent structure. We found that a choice model based on the task’s Bayesian ideal observer accurately matched many facets of human structural inference, including task performance, perceptual error patterns, single-trial responses, participant-specific differences, and subjective decision confidence—especially, when motion scenes were ambiguous and when object motion was hierarchically nested within other moving reference frames. Our work can guide future neuroscience experiments to reveal the neural mechanisms underlying higher-level visual motion perception.


Sign in / Sign up

Export Citation Format

Share Document