Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness
CNF simplifiers play a very important role in minimising structured problem hardness. Altough they can be used in an in-search process, most of them serve in a pre-search phase and rely on one form or another of resolution. Based on our understanding about problem structure, in the paper, we extend the single pre-search process to a multiple one in order to further simplify the hard structure in a problem. This extension boosts the performance of state-of-theart clause learning and lookahead...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2009)|
|01_Anbulagan_Towards_a_Generic_CNF_2009.pdf||132.6 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.