Author: buildbot
Date: Mon Jan 16 11:13:11 2012
New Revision: 802711
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 11:13:11 2012
@@ -59,13 +59,14 @@
<h1 class="title">Rules</h1>
<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>
+<h2 id="features">Features</h2>
<p>Stanbol allows to provide rules to other component, i.e., Stanbol
Reasoners, or to third parties in three different formats.</p>
<ul>
<li><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>; </li>
<li><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;</li>
<li><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 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 <a
href="rules/refactor.html">Refactor</a> 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>.</li>
</ul>
-<p>The rule pattern used for representing rules is the <em>modus ponens</em>,
e.g. <strong> if <em>condition</em> then <em>consequent</em> </strong>. For
example the axiom "every person has a father" can be expressed with
+<p>The rule pattern used for representing rules is the <em>modus ponens</em>,
e.g. _ <strong>if</strong> condition then <strong>consequent</strong>. For
example the axiom "every person has a father" can be expressed with
the modus ponens in the following way <br />
</p>
<h3 id="sub-components">Sub-Components</h3>
