This interface defines a bridge between the AssociativeFormula implementation like a concrete Disjunction and the AssociativeFormulaSupport object which adds the implementation of the common functionality.
|AssociativeFormulaSupport<T extends SimpleLogicalFormula>||
This class provides common implementation for associative formulas that are formulas which consists of several other formulas.
Abstract base class for ComplexLogicalFormula, that are formulas which implement substitute(), exchange(), getTerms(), isGround() and isWellFormed() and therefore use terms to describe themself.
This class models concepts used in description logics
A Constant represents an constant object in the world of a logical language.
A functional term in a logic language, i.e.
A functor for logic language, i.e.
An individual is an single object similar to objects used in
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.
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.
This class implements a role used in description logics Every role is an predicate consisting of two individuals
A sort of first-order logic.
This class represents terms which are objects identified by a string.
Abstract base class implementing the substitute(), getSort(), getTerms(), and containsTermsOfType() methods in a way it is useful for terms.
The abstract parent for predicates and functors implementing the TypedStructure interface.
A Variable is a placeholder for Constants in a generic formula of an logic language.