Learning to Select Branching Rules in the DPLL Procedure for Satisfiability
暂无分享,去创建一个
[1] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[2] Dan Roth,et al. On the Hardness of Approximate Reasoning , 1993, IJCAI.
[3] Andrew G. Barto,et al. Linear Least-Squares Algorithms for Temporal Difference Learning , 2005, Machine Learning.
[4] John R. Rice,et al. The Algorithm Selection Problem , 1976, Adv. Comput..
[5] Eliezer L. Lozinskii,et al. The Good Old Davis-Putnam Procedure Helps Counting Models , 2011, J. Artif. Intell. Res..
[6] Justin A. Boyan,et al. Least-Squares Temporal Difference Learning , 1999, ICML.
[7] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.
[8] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[9] Michael L. Littman,et al. MAXPLAN: A New Approach to Probabilistic Planning , 1998, AIPS.
[10] Michail G. Lagoudakis,et al. Algorithm Selection using Reinforcement Learning , 2000, ICML.
[11] Michael Wooldridge,et al. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, August 23-29, 1997, 2 Volumes , 1997, IJCAI.