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:
“It is easy enough to be friendly to one’s friends. But to befriend the one who regards himself as your enemy is the quintessence of true religion. The other is mere business.”
—Mohandas K. Gandhi (1869–1948)
“But suppose, asks the student of the professor, we follow all your structural rules for writing, what about that “something else” that brings the book alive? What is the formula for that? The formula for that is not included in the curriculum.”
—Fannie Hurst (1889–1968)