| Interface | Description |
|---|---|
| BinarySentenceProposition |
Indicator interface used to identify binary sentences.
|
| DerivedProposition | |
| Proposition |
Artificial Intelligence A Modern Approach (3rd Edition): page 486.
Propositions describing sets of possible worlds are written in a notation that combines elements of propositional logic and constraint satisfaction notation. |
| SentenceProposition |
Indicator interface used to identify Sentence Propositions.
|
| TermProposition |
A proposition on a single variable term.
|
| UnarySentenceProposition |
Indicator interface used to identify unary sentences.
|
| Class | Description |
|---|---|
| AbstractDerivedProposition | |
| AbstractProposition | |
| AbstractTermProposition | |
| AssignmentProposition | |
| ConjunctiveProposition | |
| DisjunctiveProposition |
Artificial Intelligence A Modern Approach (3rd Edition): Formula 13.4, page
489.
We can also derive the well-known formula for the probability of a disjunction, sometimes called the inclusion-exclusion principle: P(a OR b) = P(a) + P(b) - P(a AND b). |
| EquivalentProposition | |
| IntegerSumProposition | |
| NotProposition | |
| SubsetProposition |