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