Learning Short-Term Weights for GSAT

Frank, Jeremy

Learning Short-Term Weights for GSAT

Download BibTeX Cite

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 384-390.

Abstract

We investigate an improvement to GSAT which associates a weight with each clause. We change the objective function so that GSAT moves to assignments maximizing the weight of satisfied clauses, and each clause's weight is changed when GSAT moves to an assignment in which this clause is unsatisfied. We present results showing that this version of GSAT has good performance when clause weights are reduced geometrically throughout the course of a single try. We conclude that clause weights are best interpreted as short-term, context sensitive indicators of how hard different clauses are to satisfy.

Jeremy Frank. 1997. Learning Short-Term Weights for GSAT. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97. IJCAI, 384–390. https://ijcai.org/proceedings/1997/57

@inproceedings{ijcai1997p57,
  title     = {Learning Short-Term Weights for GSAT},
  author    = {Frank, Jeremy},
  booktitle = {Proceedings of the Fifteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-97}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Martha E. Pollack},
  pages     = {384--390},
  year      = {1997},
  note      = {Constraint Satisfaction},
  url       = {https://ijcai.org/proceedings/1997/57},
}

TY  - CPAPER
TI  - Learning Short-Term Weights for GSAT
AU  - Frank, Jeremy
T2  - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1997
SP  - 384
EP  - 390
UR  - https://ijcai.org/proceedings/1997/57
ER  -