Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/85854029-9F0F-4C83-9CBA-F91FC42A21D0 | - |
| Αναγνωριστικό | https://www.cs.ubc.ca/~hutter/EARG.shtml/earg/papers07/lagoudakis01learning.pdf | - |
| Γλώσσα | en | - |
| Μέγεθος | 16 pages | en |
| Τίτλος | Learning to select branching rules in the DPLL procedure for satisfiability | en |
| Δημιουργός | Lagoudakis Michael | en |
| Δημιουργός | Λαγουδακης Μιχαηλ | el |
| Δημιουργός | Littman, M. | en |
| Περίληψη | The DPLL procedure is the most popular complete satisfiability (SAT) solver. While its worst case complexity is exponential, the actual running time is greatly affected by the ordering of branch variables during the search. Several branching rules have been proposed, but none is the best in all cases. This work investigates the use of automated methods for choosing the most appropriate branching rule at each node in the search tree. We consider a reinforcementlearning approach where a value function, which predicts the performance of each branching rule in each case, is learned through trial runs on a typical problem set of the target class of SAT problems. Our results indicate that, provided sufficient training on a given class, the resulting strategy performs as well as (and, in some cases, better than) the best branching rule for that class. | en |
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Full Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-11-14 | - |
| Ημερομηνία Δημοσίευσης | 2001 | - |
| Θεματική Κατηγορία | DPLL procedure | en |
| Βιβλιογραφική Αναφορά | M. G. Lagoudakis and M. L. Littman. (2001, June). Learning to select branching rules in the DPLL procedure for satisfiability. [Online]. Available: https://www.cs.ubc.ca/~hutter/EARG.shtml/earg/papers07/lagoudakis01learning.pdf | en |
Copyright © DIAS 2013
