Resolution versus search: Two strategies for SAT

DOI10.1023/A:1006303512524zbMath0967.68147OpenAlexW1548827561MaRDI QIDQ1977760

Rina Dechter, Irina Rish

Publication date: 3 September 2001

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1006303512524

zbMATH Keywords

resolutionpropositional satisfiabilitybacktracking search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (14)

Mixed deterministic and probabilistic networks ⋮ Statistical regimes across constrainedness regions ⋮ A logical approach to efficient Max-SAT solving ⋮ Unnamed Item ⋮ A satisfiability procedure for quantified Boolean formulae ⋮ Dynamic Management of Heuristics for Solving Structured CSPs ⋮ Partition-based logical reasoning for first-order and propositional theories ⋮ Visualizing SAT instances and runs of the DPLL algorithm ⋮ Topological parameters for time-space tradeoff ⋮ Making assumptions in the automated derivation ⋮ AND/OR search spaces for graphical models ⋮ Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas ⋮ AND/OR branch-and-bound search for combinatorial optimization in graphical models ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models

This page was built for publication: Resolution versus search: Two strategies for SAT