SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
From MaRDI portal
Publication:3453227
DOI10.1007/978-3-319-24318-4_16zbMath1471.68243OpenAlexW2155840847MaRDI QIDQ3453227
Marius Lindauer, Stefan Falkner, Frank Hutter
Publication date: 20 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_16
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items
Uses Software
Cites Work
- Theory and applications of satisfiability testing -- SAT 2012. 15th international conference, Trento, Italy, June 17--20, 2012. Proceedings
- The configurable SAT solver challenge (CSSC)
- Conflict-driven answer set solving: from theory to practice
- SATenstein: automatically building local search SAT solvers from components
- Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
- Captain Jack: New Variable Selection Heuristics in Local Search for SAT
- ParamILS: An Automatic Algorithm Configuration Framework
- Automated Testing and Debugging of SAT and QBF Solvers
- Random forests
This page was built for publication: SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers