Skip to main content

Research Repository

Advanced Search

Systematic search for local-search SAT heuristics

Burnett, Andrew W.; Parkes, Andrew J.

Authors

Andrew W. Burnett psxab4@nottingham.ac.uk

Andrew J. Parkes



Abstract

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.

Citation

Burnett, A. W., & Parkes, A. J. (2016). Systematic search for local-search SAT heuristics

Conference Name 6th International Conference on Metaheuristics and Nature Inspired Computing (META 2016)
End Date Oct 31, 2016
Acceptance Date Jun 11, 2016
Publication Date Oct 29, 2016
Deposit Date Jul 21, 2016
Publicly Available Date Oct 29, 2016
Peer Reviewed Peer Reviewed
Public URL http://eprints.nottingham.ac.uk/id/eprint/35222
Related Public URLs http://meta2016.sciencesconf.org/
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf

Files


BurnettParkes-META2016.pdf (192 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations