Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/482
Title: | Instance-based selection of policies for SAT solvers | Authors: | Nikolić, Mladen Marić, Filip Janičić, Predrag |
Affiliations: | Informatics and Computer Science Informatics and Computer Science Informatics and Computer Science |
Issue Date: | 9-Nov-2009 | Related Publication(s): | International Conference on Theory and Applications of Satisfiability Testing SAT 2009 | Journal: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Abstract: | Execution of most of the modern DPLL-based SAT solvers is guided by a number of heuristics. Decisions made during the search process are usually driven by some fixed heuristic policies. Despite the outstanding progress in SAT solving in recent years, there is still an appealing lack of techniques for selecting policies appropriate for solving specific input formulae. In this paper we present a methodology for instance-based selection of solver's policies that uses a data-mining classification technique. The methodology also relies on analysis of relationships between formulae, their families, and their suitable solving strategies. The evaluation results are very good, demonstrate practical usability of the methodology, and encourage further efforts in this direction. © 2009 Springer Berlin Heidelberg. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/482 | ISBN: | 3642027768 | ISSN: | 03029743 | DOI: | 10.1007/978-3-642-02777-2_31 |
Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
30
checked on Dec 21, 2024
Page view(s)
21
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.