Automatic demonstration: rewriting techniques (French)
Automatic demonstration: rewriting techniques (French)
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Deriving Focused Calculi for Transitive Relations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Deriving Focused Lattice Calculi
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Proof systems for lattice theory
Mathematical Structures in Computer Science
Automated Element-Wise Reasoning with Sets
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
| Hi-index | 0.00 |
We formally derive tableau calculi for various lattices. They solve the word problem for the free algebra in the respective class. They are developed in and integrated into the ordered resolution theorem proving framework as special-purpose procedures. Theory-specific and procedural information is included by rewriting techniques and by imposing the subformula property on the ordering constraints. Intended applications include modal logic and the automated proof support for set-based formal methods. Our algebraic study also contributes to the foundations of tableau and sequent calculi, explaining the connection of distributivity with the data-structure of sequents and with cut-elimination.