Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Lookahead saturation with restriction for SAT

Date

Authors

Anbulagan, Anbu

Slaney, John K

Publisher

Springer

Abstract

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.

Keywords

Keywords: Benchmarking; Dynamic programming; Function evaluation; Heuristic methods; Problem solving; Benchmark problems; Dynamic equality weighting (DEW); Lookahead saturation (LAS); Neighbourhood variable ordering (NVO); Computer programming

URI

http://hdl.handle.net/1885/39185

Collections

ANU Research Publications

Source

Proceedings of International Conference on Principles and Practice of Constraint Programming (CP 2005)

Type

Conference paper

DOI

10.1007/11564751_53