A constraint-based approach to narrow search trees for satisfiability
From MaRDI portal
Publication:1606970
DOI10.1016/S0020-0190(99)00088-5zbMath1015.68518OpenAlexW2021144815MaRDI QIDQ1606970
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00088-5
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
BerkMin: A fast and robust SAT-solver ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Decision-Making Procedure for Resolution-Based SAT-Solvers ⋮ On the limit of branching rules for hard random unsatisfiable 3-SAT ⋮ Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer ⋮ Extending and implementing the stable model semantics ⋮ A parallelization scheme based on work stealing for a class of SAT solvers
This page was built for publication: A constraint-based approach to narrow search trees for satisfiability
