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:
“For true poetry, complete poetry, consists in the harmony of contraries. Hence, it is time to say aloud—and it is here above all that exceptions prove the rule—that everything that exists in nature exists in art.”
—Victor Hugo (1802–1885)
“I feel like a white granular mass of amorphous crystals—my formula appears to be isomeric with Spasmotoxin. My aurochloride precipitates into beautiful prismatic needles. My Platinochloride develops octohedron crystals,—with a fine blue florescence. My physiological action is not indifferent. One millionth of a grain injected under the skin of a frog produced instantaneous death accompanied by an orange blossom odor.”
—Lafcadio Hearn (1850–1904)