class documentation

class NegatedExpression(Expression): (source)

Known subclasses: nltk.sem.drt.DrtNegatedExpression

Constructor: NegatedExpression(term)

View In Hierarchy

Undocumented

Method __eq__ Undocumented
Method __init__ Undocumented
Method __ne__ Undocumented
Method __str__ Undocumented
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 No summary
Method visit No summary
Instance Variable term Undocumented
Property type Undocumented
Method _set_type :see Expression._set_type()

Inherited from Expression:

Class Method fromstring Undocumented
Method __and__ Undocumented
Method __call__ Undocumented
Method __gt__ Undocumented
Method __hash__ Undocumented
Method __lt__ Undocumented
Method __neg__ Undocumented
Method __or__ Undocumented
Method __repr__ Undocumented
Method applyto Undocumented
Method constants Return a set of individual constants (non-predicates). :return: set of Variable objects
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 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 make_VariableExpression Undocumented
Method normalize Rename auto-generated unique variables
Method predicates Return a set of predicates (constants, not variables). :return: set 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 simplify No summary
Method substitute_bindings 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_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...
Class Variable _logic_parser Undocumented
Class Variable _type_checking_logic_parser Undocumented
def __eq__(self, other): (source)

Undocumented

def __init__(self, term): (source)

Undocumented

def __ne__(self, other): (source)

Undocumented

def __str__(self): (source)

Undocumented

def findtype(self, variable): (source)

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>"

Parameters
variableVariable
def negate(self): (source)
See Also
Expression.negate()
def visit(self, function, combinator): (source)
See Also
Expression.visit()

Undocumented

@property
type = (source)

Undocumented

def _set_type(self, other_type=ANY_TYPE, signature=None): (source)

:see Expression._set_type()