class documentation

class PossibleAntecedents(list, DrtExpression, Expression): (source)

View In Hierarchy

Undocumented

Method __str__ Undocumented
Method free Set of free variables.
Method replace Replace all instances of variable v with expression E in self, where v is free in self.
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_equality 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 get_refs Return the set of discourse referents in this DRS. :param recursive: bool Also find discourse referents in subterms? :return: list of Variable objects
Method is_pronoun_function Is self of the form "PRO(x)"?
Method make_EqualityExpression Undocumented
Method make_VariableExpression Undocumented
Method pretty_format Draw the DRS :return: the pretty print string
Method pretty_print Undocumented
Method resolve_anaphora Undocumented
Method typecheck Undocumented
Property type Undocumented
Class Variable _drt_parser Undocumented

Inherited from Expression (via DrtExpression):

Method __call__ Undocumented
Method __eq__ Undocumented
Method __hash__ Undocumented
Method __lt__ Undocumented
Method __ne__ 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 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_bindings 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:
Method visit_structured 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...
Method _set_type Set the type of this expression to be the given type. Raise type exceptions where applicable.
Class Variable _logic_parser Undocumented
Class Variable _type_checking_logic_parser Undocumented
def __str__(self): (source)

Undocumented

def free(self): (source)

Set of free variables.

def replace(self, variable, expression, replace_bound=False, alpha_convert=True): (source)

Replace all instances of variable v with expression E in self, where v is free in self.

def _pretty(self): (source)

Undocumented