Applying UCT to boolean satisfiability

Authors:
Alessandro Previti;Raghuram Ramanujan;Marco Schaerf;Bart Selman
Affiliations:
Dipartimento di Informatica e Sistemistica Antonio Ruberti, Sapienza, Università di Roma, Roma, Italy;Department of Computer Science, Cornell University, Ithaca, New York;Dipartimento di Informatica e Sistemistica Antonio Ruberti, Sapienza, Università di Roma, Roma, Italy;Department of Computer Science, Cornell University, Ithaca, New York
Venue:
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Year:
2011

A machine program for theorem-proving

Communications of the ACM
Random 3-SAT and BDDs: The Plot Thickens Further

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Achieving master level play in 9×9 computer go

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
SATzilla: portfolio-based algorithm selection for SAT

Journal of Artificial Intelligence Research
Bandit based monte-carlo planning

ECML'06 Proceedings of the 17th European conference on Machine Learning

Monte-carlo style UCT search for boolean satisfiability

AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Guiding combinatorial optimization with UCT

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Hi-index	0.00