Skip navigation
Skip navigation

Lookahead saturation with restriction for SAT

Anbulagan, Anbu; Slaney, John K

Description

We present; a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report on the integration of this heuristic in Satz, a high-performance SAT solver, showing empirically that it significantly improves the performance on an extensive range of benchmark problems that exhibit, hard structure.

CollectionsANU Research Publications
Date published: 2005
Type: Conference paper
URI: http://hdl.handle.net/1885/39185
Source: Proceedings of International Conference on Principles and Practice of Constraint Programming (CP 2005)
DOI: 10.1007/11564751_53

Download

There are no files associated with this item.


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

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