Skip navigation
Skip navigation

Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness

Anbulagan, Anbu; Slaney, John K


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]

CollectionsANU Research Publications
Date published: 2009
Type: Conference paper
Source: Proceedings of the 21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2009)
DOI: 10.1109/ICTAI.2009.47


File Description SizeFormat Image
01_Anbulagan_Towards_a_Generic_CNF_2009.pdf132.6 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator