Author: anuzzolese
Date: Mon Jan 16 12:01:59 2012
New Revision: 1231962
URL: http://svn.apache.org/viewvc?rev=1231962&view=rev
Log:
[STANBOL-453] Committed additional documentation in Rules.
Modified:
incubator/stanbol/site/trunk/content/stanbol/docs/trunk/rules.mdtext
Modified: incubator/stanbol/site/trunk/content/stanbol/docs/trunk/rules.mdtext
URL:
http://svn.apache.org/viewvc/incubator/stanbol/site/trunk/content/stanbol/docs/trunk/rules.mdtext?rev=1231962&r1=1231961&r2=1231962&view=diff
==============================================================================
--- incubator/stanbol/site/trunk/content/stanbol/docs/trunk/rules.mdtext
(original)
+++ incubator/stanbol/site/trunk/content/stanbol/docs/trunk/rules.mdtext Mon
Jan 16 12:01:59 2012
@@ -12,13 +12,22 @@ Stanbol allows to provide rules to other
* __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>.
-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
+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:
+
+-> __if__ X is a person __then__ X has a father <-
+
+and by means of predicate calculus as:
+
+-> ∀x∃y:Person(x) ) ⇒ hasFather(x; y) <-
+
+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.
### 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
+ - [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...
## References
