Login / Signup

Looking Algebraically at Tractable Quantified Boolean Formulas.

Hubie ChenVíctor Dalmau
Published in: SAT (Selected Papers (2004)
Keyphrases
  • quantified boolean formulas
  • universally quantified
  • decision procedures
  • reasoning tasks
  • np complete
  • computational complexity
  • artificial intelligence
  • expert systems
  • np hard
  • programming language
  • heuristic search