AssociativeFormulaSupport<T extends SimpleLogicalFormula> 
This class provides common implementation for associative formulas that are
formulas which consists of several other formulas.

ComplexLogicalFormulaAdapter 
Abstract base class for ComplexLogicalFormula, that are formulas which
implement substitute(), exchange(), getTerms(), isGround() and isWellFormed()
and therefore use terms to describe themself.

Constant 
A Constant represents an constant object in the world of
a logical language.

FunctionalTerm 
A functional term in a logic language, i.e.

Functor 
A functor for logic language, i.e.

NumberTerm 
This is a term representing an integer number it is used
to distinguish between objects like an auto a which is
modeled as constant and integral numbers like 42.

Predicate 
A general predicate which contains an identifier that describes its meaning,
an argument count referred as arity and a list of sorts defining the types for
the arguments of the predicate.

QuantifiedFormulaSupport<T extends RelationalFormula> 
This class provides common functionalities for quantified formulas, i.e.

RelationalFormula 
This is the abstract base class for relational formulas,
i.e.

Sort 
A sort of firstorder logic.

StringTerm 
This class represents terms which are objects identified by a
string.

TermAdapter<T> 
Abstract base class implementing the substitute(), getSort(), getTerms(), and
containsTermsOfType() methods in a way it is useful for terms.

TypedStructureAdapter 
The abstract parent for predicates and functors implementing the
TypedStructure interface.

Variable 
A Variable is a placeholder for Constants in a generic formula of
a logic language.
