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:
“The mother as a social servant instead of a home servant will not lack in true mother duty.... From her work, loved and honored though it is, she will return to her home life, the child life, with an eager, ceaseless pleasure, cleansed of all the fret and fraction and weariness that so mar it now.”
—Charlotte Perkins Gilman (1860–1935)
“Every formula which expresses a law of nature is a hymn of praise to God.”
—Maria Mitchell (1818–1889)