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:
““If Washington were President now, he would have to learn our ways or lose his next election. Only fools and theorists imagine that our society can be handled with gloves or long poles. One must make one’s self a part of it. If virtue won’t answer our purpose, we must use vice, or our opponents will put us out of office, and this was as true in Washington’s day as it is now, and always will be.””
—Henry Brooks Adams (1838–1918)
“Ideals possess the strange quality that if they were completely realized they would turn into nonsense. One could easily follow a commandment such as “Thou shalt not kill” to the point of dying of starvation; and I might establish the formula that for the proper functioning of the mesh of our ideals, as in the case of a strainer, the holes are just as important as the mesh.”
—Robert Musil (1880–1942)