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:
“The true poem is not that which the public read. There is always a poem not printed on paper,... in the poet’s life. It is what he has become through his work. Not how is the idea expressed in stone, or on canvas or paper, is the question, but how far it has obtained form and expression in the life of the artist. His true work will not stand in any prince’s gallery.”
—Henry David Thoreau (1817–1862)
“So, if we must give a general formula applicable to all kinds of soul, we must describe it as the first actuality [entelechy] of a natural organized body.”
—Aristotle (384–323 B.C.)