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:
“Frankie and Johnny were lovers, O lordy how they could love,
Swore to be true to each other, true as the stars above;
He was her man but he done her wrong.”
—Unknown. Frankie and Johnny (l. 1–3)
“My formula for greatness in human beings is amor fati: that one wants to change nothing, neither forwards, nor backwards, nor in all eternity. Not merely to endure necessity, still less to hide it—all idealism is mendacity in the face of necessity—but rather to love it.”
—Friedrich Nietzsche (1844–1900)