HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

Preprocessing QBF

Horst Samulowitz
Horst Samulowitz
Jessica Davies
Jessica Davies
Fahiem Bacchus
Fahiem Bacchus

Principles and Practice of Constraint Programming, pp. 514-529, 2006.

Cited by: 54|Bibtex|Views8|DOI:https://doi.org/10.1007/11889205_37
EI
Other Links: dl.acm.org
Keywords:
preprocessing QBF instancestate-of-the-art QBF solverstraditional CSPsQuantified Boolean Formulaspolynomial timeMore(6+)

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments