# True quantified Boolean formula

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Design, Automation & Test in Europe Conferenceâ€¦
- 2014

For effectively solving quantified Boolean formulas (QBFs), preprocessors have shown to be of great value. A preprocessorâ€¦Â (More)

Is this relevant?

2013

2013

- ICAPS
- 2013

This paper describes a technique for translating bounded propositional reachability problems, such as Planning, into Quantifiedâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Journal of Automated Reasoning
- 2008

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

- IJCAI
- 2005

A certificate of satisfiability for a quantified boolean formula is a compact representation of one of its models which is usedâ€¦Â (More)

Is this relevant?

2004

2004

- Logic versus Approximation
- 2004

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

- SAT
- 2003

Preface Whereas the satisfiability problem of propositional logic is widely recognized as the prototypical problem for the classâ€¦Â (More)

Is this relevant?

2002

2002

- SODA
- 2002

We present algorithms for solving quantified Boolean formulas (QBF, or sometimes QSAT) with worst case runtime asymptoticallyâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IJCAR
- 2001

Deciding the satisfiability of a Quantified Boolean Formula ( QBF) is an important research issue in Artificial Intelligenceâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- AAAI/IAAI
- 2000

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

- Inf. Process. Lett.
- 1979

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)

Is this relevant?