| Home | Trees | Indices | Help |
|---|
|
|
Core of the semantics management, dealing with the RDFS and other Semantic triples. The only reason to have it in a separate class is for an easier maintainability.
This is a common superclass only. In the present module, it is subclassed by a RDFS Closure class and a OWL RL Closure classes. There are some methods that are implemented in the subclasses only, ie, this class cannot be used by itself!
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
IMaxNum maximal index of rdf:_i occurrence in the graph
|
|||
| set of triples |
added_triples triples added to the graph, conceptually, during one processing cycle |
||
| boolean |
axioms whether axioms should be added or not |
||
| boolean |
daxioms whether datatype axioms should be added or not |
||
| array of strings |
error_messages error messages (typically inconsistency messages in OWL RL) found during processing. |
||
| rdflib.Graph |
graph the real graph |
||
| LiteralProxies |
literal_proxies Literal Proxies with BNodes for the graph |
||
| boolean |
rdfs whether RDFS inference is also done (used in subclassed only) |
||
|
|||
|
Add an error message
|
Do some pre-processing step. This method before anything else in the closure. By default, this method is empty, subclasses can add content to it by overriding it. |
Do some post-processing step. This method when all processing is done, but before handling possible errors (ie, the method can add its own error messages). By default, this method is empty, subclasses can add content to it by overriding it. |
The core processing cycles through every tuple in the graph and dispatches it to the various methods implementing a specific group of rules. By default, this method raises an exception; indeed, subclasses must add content to by overriding it.
|
Add axioms. This is only a placeholder and raises an exception by default; subclasses must fill this with real content |
Add d axioms. This is only a placeholder and raises an exception by default; subclasses must fill this with real content |
This is only a placeholder; subclasses should fill this with real content. By default, it is just an empty call. This set of rules is invoked only once and not in a cycle. |
Return the literal value corresponding to a Literal node. Used in error messages.
|
In contrast to its name, this does not yet add anything to the graph itself, it just stores the tuple in an internal set. (It is important for this to be a set: some of the rules in the various closures may generate the same tuples several times.) Before adding the tuple to the set, the method checks whether the tuple is in the final graph already (if yes, it is not added to the set). The set itself is emptied at the start of every processing cycle; the triples are then effectively added to the graph at the end of such a cycle. If the set is actually empty at that point, this means that the cycle has not added any new triple, and the full processing can stop.
|
Generate the closure the graph. This is the real 'core'. The processing rules store new triples via the separate method which stores them in the added_triples array. If that array is emtpy at the end of a cycle, it means that the whole process can be stopped. If required, the relevant axiomatic triples are added to the graph before processing in cycles. Similarly the exchange of literals against bnodes is also done in this step (and restored after all cycles are over). |
|
|||
error_messageserror messages (typically inconsistency messages in OWL RL) found during processing. These are added to the final graph at the very end as separate BNodes with error messages
|
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0.1 on Fri Feb 7 15:00:18 2014 | http://epydoc.sourceforge.net |