Implementation of critical path heuristics for SAT
Date
Authors
Huang, Jinbo
Journal Title
Journal ISSN
Volume Title
Publisher
IOS Press BV
Access Statement
Abstract
Recent work has shown that SAT can be theoretically more powerful than heuristic search provided the heuristic used by search is implemented as a set of clauses on which unit propagation simulates the evaluation of the heuristic. The hmax heuristic has been shown to be implemented trivially by the empty set of clauses. This paper presents an implementation of hm, a generalization of hmax.
Description
Keywords
Citation
Collections
Source
Type
Book Title
ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration
Entity type
Publication