| Package | Description |
|---|---|
| net.sf.tweety.logics.commons.syntax | |
| net.sf.tweety.logics.commons.syntax.interfaces |
| Modifier and Type | Class and Description |
|---|---|
class |
AssociativeFormulaSupport<T extends SimpleLogicalFormula>
This class provides common implementation for associative formulas
that are formulas which consists of several other formulas.
|
class |
ComplexLogicalFormulaAdapter
Abstract base class for ComplexLogicalFormula, that are formulas which
implement substitute(), exchange(), getTerms(), isGround() and isWellFormed()
and therefore use terms to describe themself.
|
class |
Constant
A Constant represents an constant object in the world of
a logical language.
|
class |
FunctionalTerm
A functional term in a logic language, i.e.
|
class |
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.
|
class |
RelationalFormula
This is the abstract base class for relational formulas,
i.e.
|
class |
Sort
A sort of first-order logic.
|
class |
StringTerm
This class represents terms which are objects identified by a
string.
|
class |
TermAdapter<T>
Abstract base class implementing the substitute(), getSort(), getTerms(), and
containsTermsOfType() methods in a way it is useful for terms.
|
class |
Variable
A Variable is a placeholder for Constants in a generic formula of
a logic language.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
ComplexLogicalFormula
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
|
interface |
QuantifiedFormula
Interface for a QuantifiedFormula with a set of quantified variables
implementing an all- or exist-quantor for example.
|
interface |
Term<T>
A term of a logical language, that can be given as argument for logical constructs
like atoms or functors.
|
Copyright © 2018. All rights reserved.