Knuth–Bendix completion is a classical calculus in automated deduction for transforming a
set of equations into a confluent and terminating set of directed equations which can be …

Inductive theorem proving plays an important role in the field of formal verification of
systems. The rewriting induction (RI) is a method for inductive theorem proving proposed by …

1. Introduction Page 1 International Conference on Rewriting Techniques and Applications 2010
(Edinburgh), pp. 373-384 http://rewriting.loria.fr/rta/ OPTIMIZING MKBTT (SYSTEM DESCRIPTION) …

Ordered completion is one of the most frequently used calculi in equational theorem proving.
The performance of an ordered completion run strongly depends on the reduction order …

When develo** programs it is of great practical interest to verify that the resulting
programs have the desired properties. One of the most fundamental properties of programs …

A multi-context algebraic reasoning system is a computational system which can efficiently
simulate parallel processes each executing an algebraic reasoning procedure under a …

We present an automated lemma generation method for equational, inductive theorem
proving based on the term rewriting induction of Reddy and Aoto as well as the divergence …

Equations are a versatile and natural tool for various reasoning tasks. This thesis
investigates how to fully automate equational reasoning. Central to automation is Knuth and …

A system for efficiently running mutually related virtual processes as a single process is
called a multi-context reasoning system. We focus on its application to automated proof and …

This paper is about equation part two and was written in course of the Specialisation
Seminar–'Practical Logic and Automated Reasoning'. I took a closer look at equation in …