| | |
Summary: Speed Search in Truth Tables (SSTT)
A complete inductive approach to SAT
Pieter Adriaans pietera@science.uva.nl
Human Computer Studies Lab, University of Amsterdam, Kruislaan 419, Matrix I, 1098 VA, Amsterdam
Abstract
In this paper I analyze some variants of a
class of simple complete algorithms for the
satis ability problem (SAT) that are moti-
vated by an analogy between problem solv-
ing and counting. To my knowledge this
class of algorithms, which I call Speed Search
in Truth Tables (SSTT), has not been stud-
ied extensively. Results show that the ap-
plication of on-line grammar induction algo-
rithms to proof processes (Inductive-SSTT)
may lead to considerable eÆciency improve-
ments. Empirical evaluation on a set of prob-
lems from the SATLIB database corroborate
the theoretical results. Although inductive-
SSTT is less eÆcient than state-of-the-art
|
