You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@stanbol.apache.org by bu...@apache.org on 2012/01/16 13:06:12 UTC
svn commit: r802735 -
/websites/staging/stanbol/trunk/content/stanbol/docs/trunk/rules.html
Author: buildbot
Date: Mon Jan 16 12:06:11 2012
New Revision: 802735
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:06:11 2012
@@ -73,7 +73,7 @@ the modus ponens in the following way:</
</center></p>
<p>and by means of predicate calculus as:</p>
<p><center>
-∀x∃y:Person(x) ) ⇒ hasFather(x; y)
+∀x∃y.Person(x) ⇒ hasFather(x, y)
</center></p>
<p>where Person and hasF ather are two predicates.</p>
<p>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>