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’s true I’ve got no shirts to wear;
It’s true my butcher’s bill is due;
It’s true my prospects all look blue—
But don’t let that unsettle you:”
—Sir William Schwenck Gilbert (1836–1911)
“I cannot give you the formula for success, but I can give you the formula for failure—which is: Try to please everybody.”
—Herbert B. Swope (1882–1958)