True Quantified Boolean Formula
In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean formula is a formula in quantified propositional logic where every variable is quantified (or bound), using either existential or universal quantifiers, at the beginning of the sentence. Such a formula is equivalent to either true or false (since there are no free variables). If such a formula evaluates to true, then that formula is in the language TQBF. It is also known as QSAT (Quantified SAT).
Read more about True Quantified Boolean Formula: Overview, Prenex Normal Form, Solving, PSPACE-completeness, Miscellany
Famous quotes containing the words true and/or formula:
“I am speaking now of the highest duty we owe our friends, the noblest, the most sacred—that of keeping their own nobleness, goodness, pure and incorrupt.... If we let our friend become cold and selfish and exacting without a remonstrance, we are no true lover, no true friend.”
—Harriet Beecher Stowe (1811–1896)
“Hidden away amongst Aschenbach’s writing was a passage directly asserting that nearly all the great things that exist owe their existence to a defiant despite: it is despite grief and anguish, despite poverty, loneliness, bodily weakness, vice and passion and a thousand inhibitions, that they have come into being at all. But this was more than an observation, it was an experience, it was positively the formula of his life and his fame, the key to his work.”
—Thomas Mann (18751955)