class documentation
class DrtProposition(DrtExpression, Expression): (source)
Constructor: DrtProposition(variable, drs)
Undocumented
| Method | __eq__ |
Undocumented |
| Method | __init__ |
Undocumented |
| Method | __ne__ |
Undocumented |
| Method | __str__ |
Undocumented |
| Method | eliminate |
Undocumented |
| Method | fol |
Undocumented |
| Method | get |
Return the set of discourse referents in this DRS. :param recursive: bool Also find discourse referents in subterms? :return: list of Variable objects |
| Method | replace |
Replace every instance of 'variable' with 'expression' :param variable: Variable The variable to replace :param expression: Expression The expression with which to replace it :param replace_bound: bool Should bound variables be replaced... |
| Method | visit |
No summary |
| Method | visit |
No summary |
| Instance Variable | drs |
Undocumented |
| Instance Variable | variable |
Undocumented |
| Method | _pretty |
Undocumented |
Inherited from DrtExpression:
| Class Method | fromstring |
Undocumented |
| Method | __add__ |
Undocumented |
| Method | __and__ |
Undocumented |
| Method | __gt__ |
Undocumented |
| Method | __neg__ |
Undocumented |
| Method | __or__ |
Undocumented |
| Method | applyto |
Undocumented |
| Method | draw |
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 | is |
Is self of the form "PRO(x)"? |
| Method | make_ |
Undocumented |
| Method | make_ |
Undocumented |
| Method | pretty |
Draw the DRS :return: the pretty print string |
| Method | pretty |
Undocumented |
| Method | resolve |
Undocumented |
| Method | typecheck |
Undocumented |
| Property | type |
Undocumented |
| Class Variable | _drt |
Undocumented |
Inherited from Expression (via DrtExpression):
| Method | __call__ |
Undocumented |
| Method | __hash__ |
Undocumented |
| Method | __lt__ |
Undocumented |
| Method | __repr__ |
Undocumented |
| Method | constants |
Return a set of individual constants (non-predicates). :return: set of Variable objects |
| Method | findtype |
Find the type of the given variable as it is used in this expression. For example, finding the type of "P" in "P(x) & Q(x,y)" yields "<e,t>" |
| Method | free |
Return a set of all the free (non-bound) variables. This includes both individual and predicate variables, but not constants. :return: set of Variable objects |
| Method | negate |
If this is a negated expression, remove the negation. Otherwise add a negation. |
| Method | normalize |
Rename auto-generated unique variables |
| Method | predicates |
Return a set of predicates (constants, not variables). :return: set of Variable objects |
| Method | simplify |
No summary |
| Method | substitute |
No summary |
| 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 | _set |
Set the type of this expression to be the given type. Raise type exceptions where applicable. |
| Class Variable | _logic |
Undocumented |
| Class Variable | _type |
Undocumented |
overrides
nltk.sem.drt.DrtExpression.get_refsReturn the set of discourse referents in this DRS. :param recursive: bool Also find discourse referents in subterms? :return: list of Variable objects
overrides
nltk.sem.logic.Expression.replaceReplace every instance of 'variable' with 'expression' :param variable: Variable The variable to replace :param expression: Expression The expression with which to replace it :param replace_bound: bool Should bound variables be replaced? :param alpha_convert: bool Alpha convert automatically to avoid name clashes?