A graph-based method for improving GSAT

Authors:
Kalev Kask;Rina Dechter
Affiliations:
Department of Information and Computer Science, University of California, Irvine, CA;Department of Information and Computer Science, University of California, Irvine, CA
Venue:
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Year:
1996

Citing 7
Cited 2

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Nonserial Dynamic Programming

Nonserial Dynamic Programming
Improving connectionist energy minimization

Journal of Artificial Intelligence Research
GSAT and local consistency

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On the feasibility of distributed constraint satisfaction

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Random Constraint Satisfaction: Flaws and Structure

Constraints
Local Search Algorithms for SAT: An Empirical Evaluation

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satisfiability and constraint satisfaction problems. We present an improvement to GSAT that is sensitive to the problem's structure. When the problem has a tree structure the algorithm is guaranteed to find a solution in linear time. For non-tree networks, the algorithm designates a subset of nodes, called cutset, and executes a regular GSAT algorithm on this set of variables. On all the rest of the variables it executes a specialized local search algorithm for trees. This algorithm finds an assignment that, like GSAT, locally minimizes the sum of unsatisfied constraints and also globally minimizes the number of conflicts in every tree-like subnetwork. We will present results of experiments showing that this new algorithm outperforms regular GSAT on sparse networks whose cycle-cutset size is bounded by 30% of the nodes.