LADR
Library of Automated Deduction Routines
Version 2003-B (Aug 2003)
Semantics
Prover functions
Inference Rules
Formulas and Clauses
- just
-- clause justifications
- maximal
-- maximal literals
- weight
-- weight schemes for terms and clauses
- symbolcheck
-- check symbols usage
- commands
-- read commands from an input file
- fastparse
-- fast and dirty parsing for HUGE numbers of clauses or terms
- ioutil
-- I/O utilities for formulas and clauses
- pindex
-- pair indexing for clauses
- lindex
-- clause-literal indexing
- clausify
-- Clausification
- formula
-- first-order formulas and Skolemization
- clause2
-- clause utilities
- sos
-- efficient selection of given clauses
- clist
-- lists of clauses
- just
-- clause justification
- clauseid
-- clause IDs
- clause
-- clauses and literals
Indexing and Unification
- mindex
-- mating index (interface to fpa, discrim, and unification)
- discrim
-- discrimination tree indexing (wild and tame)
- fpa
-- FPA/Path indexing
- unify
-- simple unification
- btm
-- AC and C matching
- btu
-- AC and C unification
- dioph
-- Diophantine equation solving for AC unification
Terms
Basic stuff
- symbols
-- symbol table
- glist
-- simple generic lists
- putnam
-- Davis-Putnam engine
- options
-- flags and parameters
- order
-- comparing things
- clock
-- time various operations
- strbuf
-- growable strings
- hash
-- generic hash tables
- memory
-- dynamically allocate blocks of memory
- fatal
-- process exit for fatal errors
- nonport
-- nonportable utilities like username, hostname, process ID
These activities are projects of the
Mathematics and Computer Science Division
of
Argonne National Laboratory.