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

Related topics

Related topics

29 relations
2-satisfiabilityAbstract syntax treeAlternating Turing machineBoolean satisfiability problem
Expand

Broader (1)

Boolean algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Design and results of the Fifth Answer Set Programming Competition
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
Unified view of sediment transport by currents and waves. I: Initiation of motion, bed roughness, and bed-load transport
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
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… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Resolve and Expand
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
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes
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
Lower bounds for multiplayer noncooperative games of incomplete information
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 without BDDs
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
A quick method for the determination of dissolved and precipitated sulfides in cultures of sulfate-reducing bacteria
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
GO Is Polynomial-Space Hard
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
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… Expand
  • figure 1
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE