Skip navigation
Skip navigation

Extended clause learning

Huang, Jinbo


The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoretical results showing clause learning as equivalent in power to resolution. There exist, however, problems that are intractable for resolution, for which clause-learning solvers are hence doomed. In this paper, we present extended clause learning, a practical SAT algorithm that surpasses resolution in power. Indeed, we...[Show more]

CollectionsANU Research Publications
Date published: 2010
Type: Journal article
Source: Artificial Intelligence
DOI: 10.1016/j.artint.2010.07.008


File Description SizeFormat Image
01_Huang_Extended_clause_learni_2010.pdf150.72 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