svn commit: r802703 - /websites/staging/stanbol/trunk/content/stanbol/docs/trunk/rules.html

[bu...@apache.org]

Author: buildbot
Date: Mon Jan 16 10:39:35 2012
New Revision: 802703

Log:
Staging update by buildbot for stanbol

Modified:
    websites/staging/stanbol/trunk/content/stanbol/docs/trunk/rules.html

Modified: websites/staging/stanbol/trunk/content/stanbol/docs/trunk/rules.html
==============================================================================
--- websites/staging/stanbol/trunk/content/stanbol/docs/trunk/rules.html (original)
+++ websites/staging/stanbol/trunk/content/stanbol/docs/trunk/rules.html Mon Jan 16 10:39:35 2012
@@ -60,9 +60,9 @@
     <p>Stanbol Rules is a component that supports the construction and execution of inference rules. An <strong>inference rule</strong>, or transformation rule, is a syntactic rule or function which takes premises and returns a conclusion. Stanbol Rules allows to add a layer for expressing business logics by means of axioms, which encode the inference rules. These axioms can be organized into a container called <strong>recipe</strong>, which identifies a set of rules that share the same business logic and interpret them as a whole.</p>
 <p>For instance, with Stanbol Rules the administrator can define integrity checks for data fetched from heterogeneous and external sources in order to prevent unwanted formats or inconsistent data. Also, Stanbol Rules can be used to derive new knowledge or integrate information from different semantically enhanced contents.</p>
 <p>Stanbol allows to provide rules to other component, i.e., Stanbol Reasoners, or to third parties in three different formats.
-    - <strong>SWRL</strong> <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 <a href="reasoners.html">Stanbol Reasoners component</a>. 
-    - <strong>Jena Rules</strong> <a href="#jena">[2]</a>. It enables compatibility with inference engines based on Jena inference and rule language. Internally, the <a href="reasoners.html">Stanbol Reasoners component</a> provides a reasoning profile based on Jena inference.
-    - <strong>SPARQL</strong> <a href="#sparql">[3]</a>. SPARQL is a W3C recommendation as a query language for RDF. A natural way to represent inference transformation rule in SPARQL is by using the CONSTRUCT query form. For that reason Stanbl Rules can be converted to SPARQL CONSTRUCTs and executed by any SPARQL engine. Stanbol provides a particular SPARQL engine, namely the <a href="rules/refactor.html">Refactor</a> which is supposed to perform transformation of RDF graphs based on certain transformation rules. The latter allows, for instance, the vocabulary harmonization of RDF graphs retrieved from different sources in Linked Data.   <br />
+   - <strong>SWRL</strong> <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 <a href="reasoners.html">Stanbol Reasoners component</a>; 
+   - <strong>Jena Rules</strong> <a href="#jena">[2]</a>. It enables compatibility with inference engines based on Jena inference and rule language. Internally, the <a href="reasoners.html">Stanbol Reasoners component</a> provides a reasoning profile based on Jena inference;
+   - <strong>SPARQL</strong> <a href="#sparql">[3]</a>. SPARQL is a W3C recommendation as a query language for RDF. A natural way to represent inference transformation rule in SPARQL is by using the CONSTRUCT query form. For that reason Stanbl Rules can be converted to SPARQL CONSTRUCTs and executed by any SPARQL engine. Stanbol provides a particular SPARQL engine, namely the <a href="rules/refactor.html">Refactor</a> which is supposed to perform transformation of RDF graphs based on certain transformation rules. The latter allows, for instance, the vocabulary harmonization of RDF graphs retrieved from different sources in Linked Data.   <br />
 </p>
 <h3 id="sub-components">Sub-Components</h3>
 <ul>