You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@stanbol.apache.org by an...@apache.org on 2012/01/16 12:08:04 UTC
svn commit: r1231919 -
/incubator/stanbol/site/trunk/content/stanbol/docs/trunk/rules.mdtext
Author: anuzzolese
Date: Mon Jan 16 11:08:03 2012
New Revision: 1231919
URL: http://svn.apache.org/viewvc?rev=1231919&view=rev
Log:
[STANBOL-448] Typo fix 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=1231919&r1=1231918&r2=1231919&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 11:08:03 2012
@@ -10,7 +10,7 @@ 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 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
### Sub-Components