True quantified Boolean formula

Known as: QSAT, Quantified boolean formula, Quantified boolean formula problem 
In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified… (More)
Wikipedia

Related topics

Related topics

28 relations
2-satisfiabilityAbstract syntax treeAlternating Turing machineBoolean satisfiability problem
(More)

Broader (1)

Boolean algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Partial witnesses from preprocessed quantified Boolean formulas
For effectively solving quantified Boolean formulas (QBFs), preprocessors have shown to be of great value. A preprocessor… (More)
  • figure 1
  • figure 2
Is this relevant?
2013
2013
Partially Grounded Planning as Quantified Boolean Formula
This paper describes a technique for translating bounded propositional reachability problems, such as Planning, into Quantified… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Backdoor Sets of Quantified Boolean Formulas
We generalize the notion of backdoor sets from propositional formulas to quantified Boolean formulas (QBF). This allows us to… (More)
Is this relevant?
2005
2005
Extracting Certificates from Quantified Boolean Formulas
A certificate of satisfiability for a quantified boolean formula is a compact representation of one of its models which is used… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2004
2004
On Models for Quantified Boolean Formulas
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on… (More)
Is this relevant?
2003
2003
Comparing Different Prenexing Strategies for Quantified Boolean Formulas
Preface Whereas the satisfiability problem of propositional logic is widely recognized as the prototypical problem for the class… (More)
  • figure 3.4
  • figure 3.5
  • figure 3.6
  • figure 3.7
  • figure 3.8
Is this relevant?
2002
2002
Algorithms for quantified Boolean formulas
We present algorithms for solving quantified Boolean formulas (QBF, or sometimes QSAT) with worst case runtime asymptotically… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
Deciding the satisfiability of a Quantified Boolean Formula ( QBF) is an important research issue in Artificial Intelligence… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
We consider the compilation of different reasoning tasks into the evaluation problem of quantified boolean formulas (QBFs) as an… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas
Let F = Qlxr Qzxz l ** Qnx, C be a quantified Boolean formula with no free variables, where each Qi is either 3 or t, and C is in… (More)
  • figure 1
Is this relevant?