Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5713713
DOI10.1007/b137280zbMath1128.68481OpenAlexW2497844642MaRDI QIDQ5713713
Tian Sang, P. W. Beame, Henry A. Kautz
Publication date: 15 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137280
Related Items (13)
Laissez-Faire Caching for Parallel #SAT Solving ⋮ $$\#\exists $$ SAT: Projected Model Counting ⋮ On probabilistic inference by weighted model counting ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ A new probabilistic constraint logic programming language based on a generalised distribution semantics ⋮ Unnamed Item ⋮ Logical Compilation of Bayesian Networks with Discrete Variables ⋮ Robust planning with incomplete domain models ⋮ On the power of clause-learning SAT solvers as resolution engines ⋮ SampleSearch: importance sampling in presence of determinism ⋮ Leveraging belief propagation, backtrack search, and statistics for model counting ⋮ Volume Computation for Boolean Combination of Linear Arithmetic Constraints ⋮ Solving and sampling with many solutions: Satisfiability and other hard problems
Uses Software
This page was built for publication: Theory and Applications of Satisfiability Testing
