On Automating the Calculus of Relations

P. Höfner, G. Struth

Abstract: Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics and have found numerous applications in computing. We prove more than hundred theorems of relation algebras with off-the-shelf automated theorem provers. They form a basic calculus from which more advanced applications can be explored. We also present two automation experiments from the formal methods literature. Our results further demonstrate the feasibility of automated deduction with complex algebraic structures. They also open a new perspective for automated deduction in relational formal methods.

Paper: pdf


The input data for Prover9 and Waldmeister can be found here.

Contact: Peter Höfner: peter.hoefner <at> informatik.uni-augsburg.de

Last update: 2008