| Class | Description |
|---|---|
| TptpFofAndFormula |
This class implements the tptp-
|
| TptpFofAssociative |
This class models the connection between two formulae
|
| TptpFofAtom | |
| TptpFofAtomicFormula |
This class models an atom for the Tptp-Format
Each atom represents only one lower-case word.
|
| TptpFofBeliefBase |
Currently unused
Meant to be used to collect a single tptp-fof-file in one class
|
| TptpFofBinaryAssociativeFormula | |
| TptpFofBinaryFormula | |
| TptpFofBinaryNonAssociative | |
| TptpFofBinaryNonAssociativeFormula | |
| TptpFofConstant |
A constant consists of an unique identifier name and a sort.
|
| TptpFofExistsQuantifiedFormula |
This class models the Tptp-Fof-ExistsQuantifiedFormula
Format:
ExistsQuantifiedFormula :=
|
| TptpFofForallQuantifiedFormula |
This class models the Tptp-Fof-ForallQuantifiedFormula
Format:
ExistsQuantifiedFormula :=
|
| TptpFofFormula |
TODO: implement
|
| TptpFofFormulaFormat |
This class models fof-entries written to tptp files.
|
| TptpFofFunctionalTerm | |
| TptpFofFunctor |
|
| TptpFofLogicalSymbols |
This class alters the standard logic symbols to be used with the TPTP-Format,
which uses symbols different from those used in LogicalSymbols.
|
| TptpFofLogicFormula |
The Tptp logic formula class
|
| TptpFofNegation |
Negation for a given formula
|
| TptpFofOrFormula |
This class implements the tptp-
|
| TptpFofPredicate | |
| TptpFofQuantifiedFormula |
The abstract class for quantified formulas
|
| TptpFofSort |
This class represents the sort of any
|
| TptpFofStringTerm |
This class implements the generic Fof-Term-class with Strings
|
| TptpFofTerm<T> |
Term class.
|
| TptpFofUnitaryFormula | |
| TptpFofVariable |
Variables are used in quantified formulas
Each Variable must begin with an upper case letter followed by any amount (>=0) of lower case letters
|
| Enum | Description |
|---|---|
| TptpFofFormulaRole |
This class provides all tptp roles used within the tptp format.
|
Copyright © 2016. All rights reserved.