Towards an Understanding of Hill-Climbing Procedures for SAT

Recently several local hill-climbing procedures for propositional satisability have been proposed, which are able to solve large and di cult problems beyond the reach of conventional algorithms like Davis-Putnam.

• Type: Conference
• Year: 1993
• Where: AAAI
• Authors: Ian P. Gent, Toby Walsh
• Keywords: AAAI 1993, Di Cult Problems, Intelligent Agents, Local Hill-climbing Procedures, Propositional Satisability