class documentation
class DrtApplicationExpression(DrtExpression, ApplicationExpression): (source)
Constructor: DrtApplicationExpression(function, argument)
Undocumented
Method | fol |
Undocumented |
Method | get |
No summary |
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 | eliminate |
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 ApplicationExpression
(via DrtExpression
):
Method | __eq__ |
Undocumented |
Method | __init__ |
No summary |
Method | __ne__ |
Undocumented |
Method | __str__ |
Undocumented |
Method | constants |
No summary |
Method | findtype |
:see Expression.findtype() |
Method | is |
Is this expression an atom (as opposed to a lambda expression applied to a term)? |
Method | predicates |
No summary |
Method | simplify |
No summary |
Method | uncurry |
Uncurry this application expression |
Method | visit |
No summary |
Instance Variable | argument |
Undocumented |
Instance Variable | function |
Undocumented |
Property | args |
Return uncurried arg-list |
Property | pred |
Return uncurried base-function. If this is an atom, then the result will be a variable expression. Otherwise, it will be a lambda expression. |
Method | _set |
:see Expression._set_type() |
Inherited from Expression
(via DrtExpression
, ApplicationExpression
):
Method | __call__ |
Undocumented |
Method | __hash__ |
Undocumented |
Method | __lt__ |
Undocumented |
Method | __repr__ |
Undocumented |
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 | 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 | 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 | 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 |