LADR: Library of Automated Deduction Routines

Version 2004-C (May 2004)
LADR is a library of routines for constructing automated deduction software. It contains code for All of the code is written in C, and it is intended to be reasonably efficient.

Documentation

LADR is not yet ready for general use. The only documentation so far is the HTML description of the public routines which is extracted from comments in the source code. Here is the current version.

Programs

Two substantial programs have been built with LADR:

History

LADR evolved from the EQP theorem prover, which developed in 1992--1996. EQP applies to first-order equational problems and has associative-commutative unification and matching. One of the main goals in designing LADR has been to build theorem provers that include the best features of Otter (lots of bells and whistles) and EQP (AC unification, paramodulation strategies, and nonshared terms).
William McCune
Mathematics and Computer Science Division
Argonne National Laboratory