Computational complexity of quantified Boolean formulas with fixed maximal deficiency.

Hans Kleine Büning Xishun Zhao

Published in: Theor. Comput. Sci. (2008)

Keyphrases

quantified boolean formulas
computational complexity
np complete
reasoning tasks
universally quantified
decision procedures
np hard
decision problems
special case
machine learning
artificial intelligence
search space
logic programming
propositional satisfiability