A constraint-based approach to narrow search trees for satisfiability
From MaRDI portal
Publication:1606970
DOI10.1016/S0020-0190(99)00088-5zbMATH Open1015.68518OpenAlexW2021144815MaRDI QIDQ1606970FDOQ1606970
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
Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (9)
- BerkMin: A fast and robust SAT-solver
- SatEx: A web-based framework for SAT experimentation
- A parallelization scheme based on work stealing for a class of SAT solvers
- On the limit of branching rules for hard random unsatisfiable 3-SAT
- Parallelizing SATZ using dynamic workload balancing
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Exploiting the real power of unit propagation lookahead
- Extending and implementing the stable model semantics
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
This page was built for publication: A constraint-based approach to narrow search trees for satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606970)
