Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5713722
DOI10.1007/b137280zbMath1128.68487OpenAlexW2497844642MaRDI QIDQ5713722
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
Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (12)
Counting with Combined Splitting and Capture–Recapture Methods ⋮ Approximate Model Counting via Extension Rule ⋮ Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra ⋮ On probabilistic inference by weighted model counting ⋮ Stochastic enumeration method for counting NP-hard problems ⋮ On the Tractability of SHAP Explanations ⋮ Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting ⋮ Two approximate algorithms for model counting ⋮ 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 ⋮ Estimating the volume of solution space for satisfiability modulo linear real arithmetic
This page was built for publication: Theory and Applications of Satisfiability Testing
