| | |
- term.Function(term.BuiltIn)
-
- BI_dtLit(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_equals(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_langLit(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_query(term.LightBuiltIn, term.Function)
- BI_semantics(term.HeavyBuiltIn, term.Function)
- BI_typeErrorReturner(term.LightBuiltIn, term.Function)
- term.HeavyBuiltIn(term.GenericBuiltIn)
-
- BI_lamePred(term.HeavyBuiltIn, term.MultipleReverseFunction)
- BI_semantics(term.HeavyBuiltIn, term.Function)
- term.LightBuiltIn(term.GenericBuiltIn)
-
- BI_dtLit(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_equals(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_greaterThan
- BI_langLit(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_lessThan
- BI_notEquals
- BI_notGreaterThan
- BI_notLessThan
- BI_query(term.LightBuiltIn, term.Function)
- BI_truthValue
- BI_typeErrorIsTrue
- BI_typeErrorReturner(term.LightBuiltIn, term.Function)
- term.MultipleReverseFunction(term.ReverseFunction)
-
- BI_lamePred(term.HeavyBuiltIn, term.MultipleReverseFunction)
- term.ReverseFunction(term.BuiltIn)
-
- BI_dtLit(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_equals(term.LightBuiltIn, term.Function, term.ReverseFunction)
- BI_langLit(term.LightBuiltIn, term.Function, term.ReverseFunction)
class BI_dtLit(term.LightBuiltIn, term.Function, term.ReverseFunction) |
| | |
- Method resolution order:
- BI_dtLit
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.ReverseFunction
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evalObj(self, subj, queue, bindings, proof, query)
- evalSubj(self, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_equals(term.LightBuiltIn, term.Function, term.ReverseFunction) |
| | |
- Method resolution order:
- BI_equals
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.ReverseFunction
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
- evalObj(self, subj, queue, bindings, proof, query)
- evalSubj(self, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_greaterThan(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_greaterThan
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluate(self, subject, object)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.BuiltIn:
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use
evaluate, subject, etc.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_lamePred(term.HeavyBuiltIn, term.MultipleReverseFunction) |
| | |
- Method resolution order:
- BI_lamePred
- term.HeavyBuiltIn
- term.GenericBuiltIn
- term.MultipleReverseFunction
- term.ReverseFunction
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
- evalSubj(self, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.MultipleReverseFunction:
- evalObj(self, subj, queue, bindings, proof, query)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_langLit(term.LightBuiltIn, term.Function, term.ReverseFunction) |
| | |
- Method resolution order:
- BI_langLit
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.ReverseFunction
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evalObj(self, subj, queue, bindings, proof, query)
- evalSubj(self, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_lessThan(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_lessThan
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluate(self, subject, object)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.BuiltIn:
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use
evaluate, subject, etc.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_notEquals(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_notEquals
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_notGreaterThan(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_notGreaterThan
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluate(self, subject, object)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.BuiltIn:
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use
evaluate, subject, etc.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_notLessThan(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_notLessThan
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evaluate(self, subject, object)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.BuiltIn:
- eval(self, subj, obj, queue, bindings, proof, query)
- This function which has access to the store, unless overridden,
calls a simpler one which uses python conventions.
To reduce confusion, the inital ones called with the internals available
use abreviations "eval", "subj" etc while the python-style ones use
evaluate, subject, etc.
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_query(term.LightBuiltIn, term.Function) |
| | |
- Method resolution order:
- BI_query
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evalObj(self, subj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_semantics(term.HeavyBuiltIn, term.Function) |
| |
The semantics of a resource are its machine-readable meaning, as an
N3 forumula. The URI is used to find a represnetation of the resource in bits
which is then parsed according to its content type.
|
| |
- Method resolution order:
- BI_semantics
- term.HeavyBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evalObj(self, subj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_truthValue(term.LightBuiltIn) |
| | |
- Method resolution order:
- BI_truthValue
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_typeErrorIsTrue(term.LightBuiltIn) |
| |
Subject is anything (must be bound. 1 works well)
Object is a formula containing the test as its only triple
|
| |
- Method resolution order:
- BI_typeErrorIsTrue
- term.LightBuiltIn
- term.GenericBuiltIn
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- eval(self, subj, obj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
|
class BI_typeErrorReturner(term.LightBuiltIn, term.Function) |
| | |
- Method resolution order:
- BI_typeErrorReturner
- term.LightBuiltIn
- term.GenericBuiltIn
- term.Function
- term.BuiltIn
- term.Fragment
- term.LabelledNode
- term.Node
- term.Term
- __builtin__.object
Methods defined here:
- evalObj(self, subj, queue, bindings, proof, query)
Methods inherited from term.GenericBuiltIn:
- __init__(self, resource, fragid)
Methods inherited from term.Function:
- eval(self, subj, obj, queue, bindings, proof, query)
Static methods inherited from term.BuiltIn:
- __new__(cls, *args, **keywords)
Data and other attributes inherited from term.BuiltIn:
- all = []
Methods inherited from term.Fragment:
- compareTerm(self, other)
- dereference(self, mode='', workingContext=None)
- dereference an identifyer, finding the semantics of its schema if any
Returns None if it cannot be retreived.
- generated(self)
- A generated identifier?
This arises when a document is parsed and a arbitrary
name is made up to represent a node with no known URI.
It is useful to know that its ID has no use outside that
context.
- representation(self, base=None)
- Optimize output if prefixes available
- uriref(self)
- uriref2(self, base)
Methods inherited from term.LabelledNode:
- classOrder(self)
Methods inherited from term.Term:
- __repr__(self)
- This method only used for debugging output - it can be ambiguous,
as it is is deliberately short to make debug printout readable.
output as XML qnames [http://www.w3.org/TR/REC-xml-names/#NT-QName].
This could be beefed up to guarantee unambiguity.
- asPair(self)
- Representation in an earlier format, being phased out 2002/08
The first part of the pair is a constant number represnting the type
see RDFSink.py. the second is the value -- uri for symbols,
string for literals
- compareAnyTerm(self, other)
- Compare two langauge items
This is a cannoncial ordering in that is designed to allow
the same graph always to be printed in the same order.
This makes the regression tests possible.
The literals are deemed smaller than symbols, which are smaller
than formulae. This puts the rules at the botom of a file where
they tend to take a lot of space anyway.
Formulae have to be compared as a function of their sorted contents.
@@ Anonymous nodes have to, within a given Formula, be compared as
a function of the sorted information about them in that context.
This is not done yet
- debugString(self, already=[])
- doesNodeAppear(self, symbol)
- Does that node appear within this one
This non-overloaded function will simply return if I'm equal to him
- freeVariables(self)
- occurringIn(self, vars)
- substituteEquals(self, bindings, newRedirections)
- Return this or a version of me with substitution made
- substitution(self, bindings, why=None, cannon=False)
- Return this or a version of me with subsitution made
- unify(self, other, env1=Env({}), env2=Env({}), vars=set([]), universals=set([]), existentials=set([]), n1Source=32, n2Source=32)
- unifySecondary(self, other, env1, env2, vars, universals, existentials, n1Source=55, n2Source=55)
- value(self)
- As a python value - by default, none exists, use self
Data and other attributes inherited from term.Term:
- __dict__ = <dictproxy object>
- dictionary for instance variables (if defined)
- __weakref__ = <attribute '__weakref__' of 'Term' objects>
- list of weak references to the object (if defined)
| |