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:
“All that stock of arguments [the skeptics] produce to depreciate our faculties, and make mankind appear ignorant and low, are drawn principally from this head, to wit, that we are under an invincible blindness as to the true and real nature of things.”
—George Berkeley (1685–1753)
““It’s hard enough to adjust [to the lack of control] in the beginning,” says a corporate vice president and single mother. “But then you realize that everything keeps changing, so you never regain control. I was just learning to take care of the belly-button stump, when it fell off. I had just learned to make formula really efficiently, when Sarah stopped using it.””
—Anne C. Weisberg (20th century)