New methods to represent variables as parts of the classical truth table lead to complete evaluation methods that generate a compiled, efficient version of logical expressions.
The new methods are suitable for use in, e.g., relational database applications in which both, efficient query times as well as logical completeness and consistency are required in the context of general constraint treatments.
Input/output operations remain linear in the length of the input character strings regardless of the complexity of the logical theory.
A new processing method of formulas is described as the basis for the efficiency increase.
In order to find a specific truth-value, pattern trees are used representing the extension of the logical theory.