In this paper we perform a preliminary investigation into the application of sampling-based search algorithms to satisfiability testing of propositional formulas in Conjunctive Normal Form (CNF). In particular, we adapt the Upper Confidence bounds applied to Trees (UCT) algorithm [5] which has been successfully used in many game playing programs including MoGo, one of the strongest computer Go players [3]. © 2011 Springer-Verlag.
Applying UCT to Boolean Satisfiability / Alessandro, Previti; Raghuram, Ramanujan; Schaerf, Marco; Bart, Selman. - STAMPA. - 6695:(2011), pp. 373-374. (Intervento presentato al convegno 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011 tenutosi a Ann Arbor, MI nel 19 June 2011 through 22 June 2011) [10.1007/978-3-642-21581-0_35].
Applying UCT to Boolean Satisfiability
SCHAERF, Marco;
2011
Abstract
In this paper we perform a preliminary investigation into the application of sampling-based search algorithms to satisfiability testing of propositional formulas in Conjunctive Normal Form (CNF). In particular, we adapt the Upper Confidence bounds applied to Trees (UCT) algorithm [5] which has been successfully used in many game playing programs including MoGo, one of the strongest computer Go players [3]. © 2011 Springer-Verlag.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2011_11573-369008.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
72.06 kB
Formato
Adobe PDF
|
72.06 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
