Author: buildbot
Date: Mon Jan 16 12:02:05 2012
New Revision: 802731
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 12:02:05 2012
@@ -66,13 +66,17 @@
<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</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>
+<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:</p>
+<p>-> <strong>if</strong> X is a person <strong>then</strong> X has a
father <-</p>
+<p>and by means of predicate calculus as:</p>
+<p>-> ∀x∃y:Person(x) ) ⇒ hasFather(x; y) <-</p>
+<p>where Person and hasF ather are two predicates.
+The Stanbol Rules component allows to add a layer which enables Stanbol to
express business logics by means of axioms, i.e., rules. These axioms can be
organized into a container called Recipe, which groups and identifies set of
rules which share the same business logic and interprets them as a whole.</p>
<h3 id="sub-components">Sub-Components</h3>
<ul>
-<li><a href="rules/language.html">Rule language</a> - specifies the syntax
used in Stanbol in order to represent rules. Stanbol rules can be as SWRL, Jema
rules or SPARQL CONSTRUCT</li>
-<li><a href="rules/store.html">Rule Store</a> - allows to rules
persistence. Rules in set called <strong>recipies</strong>, which are designed
to aggregate rules by their functionality</li>
+<li><a href="rules/language.html">Rule language</a> - specifies the syntax
used in Stanbol in order to represent rules. Stanbol rules can be as SWRL, Jema
rules or SPARQL CONSTRUCT;</li>
+<li><a href="rules/store.html">Rule Store</a> - allows to rules
persistence. Rules in set called <strong>recipies</strong>, which are designed
to aggregate rules by their functionality;</li>
<li><a href="rules/refactor.html">Refactor</a> - 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... <br />
</li>
</ul>
