Resolution versus search: Two strategies for SAT
From MaRDI portal
Recommendations
Cited in
(20)- AND/OR search spaces for graphical models
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Memory intensive AND/OR search for combinatorial optimization in graphical models
- A satisfiability procedure for quantified Boolean formulae
- A comparison between SAT and CSP techniques
- Resolution in solving graph problems
- A logical approach to efficient Max-SAT solving
- Partition-based logical reasoning for first-order and propositional theories
- Visualizing SAT instances and runs of the DPLL algorithm
- SatEx: A web-based framework for SAT experimentation
- Resolution versus search: Two strategies for SAT
- Dynamic Management of Heuristics for Solving Structured CSPs
- The language of search
- Learning to integrate deduction and search in reasoning about quantified Boolean formulas
- scientific article; zbMATH DE number 2084754 (Why is no real title available?)
- Advances in Artificial Intelligence
- Topological parameters for time-space tradeoff
- Making assumptions in the automated derivation
- Mixed deterministic and probabilistic networks
- Statistical regimes across constrainedness regions
This page was built for publication: Resolution versus search: Two strategies for SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977760)
