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 does not disturb me that those whom I pardon are said to have deserted me so that
they might again bring war against me. I prefer nothing more than that I should be true to
myself and they to themselves.”
—Julius Caesar [Gaius Julius Caesar] (100–44 B.C.)
“I take it that what all men are really after is some form or perhaps only some formula of peace.”
—Joseph Conrad (1857–1924)