Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/476
Title: Simple algorithm portfolio for SAT
Authors: Nikolić, Mladen 
Marić, Filip 
Janičić, Predrag 
Affiliations: Informatics and Computer Science 
Informatics and Computer Science 
Informatics and Computer Science 
Keywords: Algorithm portfolios;Nearest neighbors;SAT solving
Issue Date: 1-Dec-2013
Journal: Artificial Intelligence Review
Abstract: 
The importance of algorithm portfolio techniques for SAT has long been noted, and a number of very successful systems have been devised, including the most successful one - SATzilla. However, all these systems are quite complex (to understand, reimplement, or modify). In this paper we present an algorithm portfolio for SAT that is extremely simple, but in the same time so efficient that it outperforms SATzilla. For a new SAT instance to be solved, our portfolio finds its k-nearest neighbors from the training set and invokes a solver that performs the best for those instances. The main distinguishing feature of our algorithm portfolio is the locality of the selection procedure - the selection of a SAT solver is based only on few instances similar to the input one. An open source tool that implements our approach is publicly available. © 2011 Springer Science+Business Media B.V.
URI: https://research.matf.bg.ac.rs/handle/123456789/476
ISSN: 02692821
DOI: 10.1007/s10462-011-9290-2
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

22
checked on Dec 20, 2024

Page view(s)

14
checked on Dec 23, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.