Experimental study on strategy of combining SAT algorithms

DOI10.1007/BF02946504MaRDI QIDQ1273082zbMATH OpenOpenAlexFDO

Authors Weifeng Lu, Yuping Zhang

Publication date 12 April 1999

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02946504

zbMATH Keywords

SAT algorithms

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• SATzilla: portfolio-based algorithm selection for SAT
• scientific article; zbMATH DE number 1182571
• The Multi-SAT algorithm
• Probabilistic performance of a heurisic for the satisfiability problem
• scientific article; zbMATH DE number 956858

Cites work

• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems

This page was built for publication: Experimental study on strategy of combining SAT algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273082)