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:
“... word-sniffing ... is an addiction, like glue—or snow—sniffing in a somewhat less destructive way, physically if not economically.... As an addict ... I am almost guiltily interested in converts to my own illness, and in a pinch I can recommend nearly any reasonable solace, whether or not it qualifies as a true descendant of Noah Webster.”
—M.F.K. Fisher (1908–1992)
“For the myth is the foundation of life; it is the timeless schema, the pious formula into which life flows when it reproduces its traits out of the unconscious.”
—Thomas Mann (1875–1955)