Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Answer Set Programming (ASP) is a well-established paradigm of declarative programming that has been developed in the field of… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Attention is given to the properties of sediment beds over the full range of conditions (silts to gravel), in particular the… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
P systems are parallel molecular computing models based on processing multisets of objects in cell-like membrane structures… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Abstract This paper (see also [1]) extends the alternating Turing machine (A-TM) of Chandra, Kozen and Stockmeyer [2], the… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Dissolved sulfide was determined spectrophotometrically as a colloidal solution of copper sulfide. Calibration curves were linear… Expand
  • table I
Is this relevant?
Highly Cited
1980
Highly Cited
1980
It is shown that, given an arbitrary GO position on an n × n board, the problem of determining the winner is Pspace hard. New… Expand
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1979
Highly Cited
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… Expand
  • figure 1
Is this relevant?