A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
Local search techniques have attracted considerable interest in the artificial intelligence community since the development of GSAT and the minconflicts heuristic for solving propositional satisfiability (SAT) problems and binary constraint satisfaction problems (CSPs) respectively. Newer techniques, such as the discrete Langrangian method (DLM), have significantly * The authors gratefully acknowledge the financial support of the Australian Research Council, grant A00000118, in the conduct ofdoi:10.1093/logcom/14.1.93 fatcat:gz4tqm747nap5kewhdqptly6xe