|
Class Summary |
| Atom |
An Atom is one of the most basic building blocks for a Sentence. |
| BinaryConnectedSentence |
This class represents a Sentence that consists of a Connective that connects
two sub-Sentences. |
| Clause |
A Clause consists of a list of Literals that are interpreted as a
disjunction. |
| ConnectedSentence |
This class represents a Sentence that consists of a Connective that connects
a number of (at least two) sub-Sentences. |
| DPSolverIE |
|
| IntEncodedClause |
An IntEncodedClause consists of a list of Literals that are interpreted as a
disjunction. |
| IntEncodedClause.CnfIntEncodedClauseListAdaptor |
|
| IntEncodedClause.IntEncodedClauseList |
|
| IntEncodedClause.LiteralSet |
|
| IntEncoding |
This class can be used to encode propositional symbols as integers, which
have the potential of being processed far more efficiently. |
| Interpretation |
An Interpretation in the propositional logic is an assignment of truth values
to propositional Atom. |
| Interpretation.InterpretationIterator |
|
| InterpretationEnumerator |
This class is a very simple and inefficient TheoremProver that enumerates all
possible Interpretation to find models that satisfy or falsify a given
Sentence. |
| KifSentenceAdaptor |
This class is an adaptor between the ai.krr.propositions.Sentence class that
can be used as an internal representation for reasoning and its external form
as defined by the KIF syntax as described below. |
| Literal |
A Literal is one of the most basic building blocks for a Sentence. |
| NegatedSentence |
A NegatedSentence is the simplest kind of complex Sentence. |
| RTPSolverIE |
|
| Sentence |
A Sentence is usually used in logic to represent a proposition that is either
true or false. |
| TruthValue |
A TruthValue is one of the most basic building blocks for a Sentence. |
| XplSentenceAdaptor |
This class is an adaptor between the ai.krr.propositions.Sentence class that
can be used as an internal representation for reasoning and its external form
in an XML Syntax. |