Principles and Practice of Constraint Programming, pp. 514-529, 2006.
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there has been a great deal of recent interest and progress in solving such instances efficiently. Ideas from QBF have also started to migrate to CSP with the explor...More
Full Text (Upload PDF)
PPT (Upload PPT)