Semantic Web | RDF | OWL


Euler proof mechanism

$Id: index.html,v 1.402 2004/01/25 19:38:43 amdus Exp $ Version R3680 by Jos De Roo of AGFA.
See Euler FAQ at EulerSharp and see also W3C Cwm.

Testing (*) RDF test cases obtaining RDF test results and testing OWL test cases obtaining OWL test results
using rule sets such as rdfs-rules, xsd-rules, owl-rules, log-rules, ...

(*) Test cases have a THIS part and a THAT part such that assuming the THIS part implies the THAT part.
Test cases have explicit assumptions because assumptions should be checked.
Test cases make issues observable (both issues w.r.t. requirements and designissues).
Test cases lead to test results which are one of passing, failing, undecided or no-data.
Test cases can be in the following state: proposed, approved, extra-credit or obsoleted.


Given a set of facts and rules, ask a question and get a proof for it.


The axioms are acquired from the Web and translated into a kind of logic program. The proof engine uses the resolution inference mechanism and only follows Euler paths (the concept Euler found several hundred years ago) so that endless deductions are avoided. That means that no special attention has to be paid to recursions or to graph merging.

The so called proof thing is a SOUND ARGUMENT: