Exploring the Computational Tradeoff of more Reasoning and Less Searching
Fahiem Bacchus · 2002
this paper we demonstrate that both of these phenomena can occur. In particular, we show that using an even more expensive form of reasoning than performed by 2clsVER can achieve a better tradeoff between reasoning time and search reduction and thus achieve significantly better performance. In some cases, we will also see that the net rate of nodes/seconds can also be improved due to the additional simplification being done at the top of the search tree. In the sequel we explain the reasoning that we employ, and show some empirical results