class documentation
class ConstantExpression(AbstractVariableExpression): (source)
Known subclasses: nltk.sem.drt.DrtConstantExpression
Constructor: ConstantExpression(variable)
This class represents variables that do not take the form of a single character followed by zero or more digits.
Method | constants |
No summary |
Method | free |
No summary |
Method | _set |
:see Expression._set_type() |
Inherited from AbstractVariableExpression
:
Method | __eq__ |
Allow equality between instances of AbstractVariableExpression subtypes. |
Method | __init__ |
No summary |
Method | __lt__ |
Undocumented |
Method | __ne__ |
Undocumented |
Method | __str__ |
Undocumented |
Method | findtype |
:see Expression.findtype() |
Method | predicates |
No summary |
Method | replace |
No summary |
Method | simplify |
No summary |
Instance Variable | variable |
Undocumented |
Inherited from Expression
(via AbstractVariableExpression
):
Class Method | fromstring |
Undocumented |
Method | __and__ |
Undocumented |
Method | __call__ |
Undocumented |
Method | __gt__ |
Undocumented |
Method | __hash__ |
Undocumented |
Method | __neg__ |
Undocumented |
Method | __or__ |
Undocumented |
Method | __repr__ |
Undocumented |
Method | applyto |
Undocumented |
Method | equiv |
Check for logical equivalence. Pass the expression (self <-> other) to the theorem prover. If the prover says it is valid, then the self and other are equal. |
Method | make_ |
Undocumented |
Method | negate |
If this is a negated expression, remove the negation. Otherwise add a negation. |
Method | normalize |
Rename auto-generated unique variables |
Method | substitute |
No summary |
Method | typecheck |
Infer and check types. Raise exceptions if necessary. |
Method | variables |
Return a set of all the variables for binding substitution. The variables returned include all free (non-bound) individual variables and any variable starting with '?' or '@'. :return: set of Variable objects... |
Method | visit |
Recursively visit subexpressions. Apply 'function' to each subexpression and pass the result of each function application to the 'combinator' for aggregation: |
Method | visit |
Recursively visit subexpressions. Apply 'function' to each subexpression and pass the result of each function application to the 'combinator' for aggregation. The combinator must have the same signature as the constructor... |
Class Variable | _logic |
Undocumented |
Class Variable | _type |
Undocumented |