Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/476
DC FieldValueLanguage
dc.contributor.authorNikolić, Mladenen_US
dc.contributor.authorMarić, Filipen_US
dc.contributor.authorJaničić, Predragen_US
dc.date.accessioned2022-08-13T09:51:52Z-
dc.date.available2022-08-13T09:51:52Z-
dc.date.issued2013-12-01-
dc.identifier.issn02692821en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/476-
dc.description.abstractThe 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.en
dc.relation.ispartofArtificial Intelligence Reviewen
dc.subjectAlgorithm portfoliosen
dc.subjectNearest neighborsen
dc.subjectSAT solvingen
dc.titleSimple algorithm portfolio for SATen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s10462-011-9290-2-
dc.identifier.scopus2-s2.0-84890436181-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84890436181-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.firstpage457en
dc.relation.lastpage465en
dc.relation.volume40en
dc.relation.issue4en
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-7219-6960-
crisitem.author.orcid0000-0001-8922-4948-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

22
checked on Dec 20, 2024

Page view(s)

14
checked on Dec 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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