LADR: Library of Automated Deduction Routines
LADR is a library of routines for constructing automated
deduction software. It contains code for
- parsing and printing formulas,
- indexing terms and literals,
- unification and matching,
- associative-commutative unification and matching,
- term rewriting,
- subsumption,
- inference rules,
- finite interpretations,
- and lots of other stuff.
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:
- Mace4 (version 2003-B).
This program searches for finite models of first-order statements.
Several simple programs built with LADR are included in the Mace4
distribution package.
- A theorem prover in the style of
Otter.
This program has not yet been released.
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