Towards an understanding of hill-climbing procedures for SAT

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 1993, Pages 28-33

  Gent, Ian P ^a   Walsh, Toby ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ENCODING (SYMBOLS); PERFORMANCE; RANDOM PROCESSES; STATE ASSIGNMENT; THEOREM PROVING;

DAVIS-PUTNAM ALGORITHMS; GREEDINESS; HILL CLIMBING PROCEDURES; PROPOSITIONAL SATISFIABILITY; RANDOMNESS;

ARTIFICIAL INTELLIGENCE;

EID: 0027706281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (0)