Systematic search for local-search SAT heuristics

Burnett, Andrew W. and Parkes, Andrew J. (2016) Systematic search for local-search SAT heuristics. In: 6th International Conference on Metaheuristics and Nature Inspired Computing (META 2016), 27-31 Oct 2016, Marrakech, Morocco. (In Press)

[img] PDF - Repository staff only until 1 November 2016. - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (192kB)


Heuristics for local-search are a commonly used method of improving the performance of algorithms that solve hard computational problems. Generally these are written by human experts, however a long-standing research goal has been to automate the construction of these heuristics. In this paper, we investigate the applicability of a systematic search on the space of heuristics to be used in a local-search SAT solver.

Item Type: Conference or Workshop Item (Paper)
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Related URLs:
Depositing User: Parkes, Andrew
Date Deposited: 21 Jul 2016 09:52
Last Modified: 16 Sep 2016 11:08

Actions (Archive Staff Only)

Edit View Edit View