Author: fchrist
Date: Mon Jul 16 13:08:40 2012
New Revision: 1362021
URL: http://svn.apache.org/viewvc?rev=1362021&view=rev
Log:
STANBOL-692 fixed links
Modified:
incubator/stanbol/site/trunk/content/stanbol/docs/trunk/components/rules/index.mdtext
Modified:
incubator/stanbol/site/trunk/content/stanbol/docs/trunk/components/rules/index.mdtext
URL:
http://svn.apache.org/viewvc/incubator/stanbol/site/trunk/content/stanbol/docs/trunk/components/rules/index.mdtext?rev=1362021&r1=1362020&r2=1362021&view=diff
==============================================================================
---
incubator/stanbol/site/trunk/content/stanbol/docs/trunk/components/rules/index.mdtext
(original)
+++
incubator/stanbol/site/trunk/content/stanbol/docs/trunk/components/rules/index.mdtext
Mon Jul 16 13:08:40 2012
@@ -17,7 +17,7 @@ Data as external knowledge bases for a g
Now the problem how to use data from those datasets expressed with some
external
and heterogeneous vocabularies or ontologies within the CMS has.
Furthermore the CMS has its own way to formalize knowledge, namely the its
-Ontology Network managed by [Stanbol OntoNet](../ontologymanager/ontonet.html).
+Ontology Network managed by [Stanbol OntoNet](../ontologymanager/ontonet/).
The solution is provided by Refactor which allows to interpret the rules of
inference as refactoring rules in order harmonize external data to the
Stanbol's ontologies.
@@ -28,9 +28,9 @@ from different semantically enhanced con
Stanbol allows to provide rules to other component, i.e., Stanbol Reasoners,
or to third parties in three different formats.
-* __SWRL__ <a href="#swrl">[1]</a>. The Semantic Web Rule Language (SWRL) is a
rule language which combines OWL DL with the Unary/Binary Datalog RuleML
sublanguages of the Rule Markup Language and enables enables Horn-like rules to
be combined with an OWL knowledge base. Providing Stanbol Rules as SWRL rules
means that they can be interpreted in classical DL reasoning. That allows, for
inantace, to use Stanbol Rules with any of the OWL 2 reasoners configured in
the [Stanbol Reasoners component](reasoners.html);
-* __Jena Rules__ <a href="#jena">[2]</a>. It enables compatibility with
inference engines based on Jena inference and rule language. Internally, the
[Stanbol Reasoners component](reasoners.html) provides a reasoning profile
based on Jena inference;
-* __SPARQL__ <a href="#sparql">[3]</a>. SPARQL is a W3C recommendation as a
query language for RDF. A natural way to represent inference transformation
rules in SPARQL is by using the CONSTRUCT query form. Stanbl Rules can be
converted to SPARQL CONSTRUCTs and executed by any SPARQL engine. Stanbol
provides a particular SPARQL engine, namely the [Refactor](rules/refactor.html)
which is supposed to perform transformation of RDF graphs based on
transformation rules defined in Stanbol. The latter allows, for instance, the
vocabulary harmonization of RDF graphs retrieved from different sources in
Linked Data <a href="#linkeddata">[4]</a>.
+* __SWRL__ <a href="#swrl">[1]</a>. The Semantic Web Rule Language (SWRL) is a
rule language which combines OWL DL with the Unary/Binary Datalog RuleML
sublanguages of the Rule Markup Language and enables enables Horn-like rules to
be combined with an OWL knowledge base. Providing Stanbol Rules as SWRL rules
means that they can be interpreted in classical DL reasoning. That allows, for
inantace, to use Stanbol Rules with any of the OWL 2 reasoners configured in
the [Stanbol Reasoners component](../reasoner/);
+* __Jena Rules__ <a href="#jena">[2]</a>. It enables compatibility with
inference engines based on Jena inference and rule language. Internally, the
[Stanbol Reasoner component](../reasoner/) provides a reasoning profile based
on Jena inference;
+* __SPARQL__ <a href="#sparql">[3]</a>. SPARQL is a W3C recommendation as a
query language for RDF. A natural way to represent inference transformation
rules in SPARQL is by using the CONSTRUCT query form. Stanbl Rules can be
converted to SPARQL CONSTRUCTs and executed by any SPARQL engine. Stanbol
provides a particular SPARQL engine, namely the [Refactor](refactor.html) which
is supposed to perform transformation of RDF graphs based on transformation
rules defined in Stanbol. The latter allows, for instance, the vocabulary
harmonization of RDF graphs retrieved from different sources in Linked Data <a
href="#linkeddata">[4]</a>.
The rule pattern used for representing rules is the _modus ponens_, e.g.
___if___ _condition_ ___then___ _consequent_ . For example the axiom _"every
person has a father"_ can be expressed with
the modus ponens in the following way:
@@ -51,9 +51,9 @@ The Stanbol Rules component allows to ad
### Sub-Components
- - [Rule language](rules/language.html) - specifies the syntax used in
Stanbol in order to represent rules. Stanbol rules can be as SWRL, Jema rules
or SPARQL CONSTRUCT;
- - [Rule Store](rules/store.html) - allows to rules persistence. Rules
in set called __recipies__, which are designed to aggregate rules by their
functionality;
- - [Refactor](rules/refactor.html) - performs RDF graphs transformations
to specific target vocabularies or ontologies by means of rules. This allows
the harmonization and the alignment of RDF graphs expressed with different
vocabularies, e.g., DBpedia, schema.org etc...
+ - [Rule language](language.html) - specifies the syntax used in Stanbol
in order to represent rules. Stanbol rules can be as SWRL, Jema rules or SPARQL
CONSTRUCT;
+ - [Rule Store](store.html) - allows to rules persistence. Rules in set
called __recipies__, which are designed to aggregate rules by their
functionality;
+ - [Refactor](refactor.html) - performs RDF graphs transformations to
specific target vocabularies or ontologies by means of rules. This allows the
harmonization and the alignment of RDF graphs expressed with different
vocabularies, e.g., DBpedia, schema.org etc...
## References
