Euler Proof Mechanism

Euler is an inference engine supporting logic based proofs. It is a backward-chaining reasoner enhanced with Euler path detection. It has implementations in Java, C#, Python, Javascript and Prolog. Via N3 it is interoperable with W3C Cwm.

README, GUIDE, DONE, FAQ and LICENSE
Things are described in N3 thanks to Tim Berners-Lee and Dan Connolly.

      Euler   
      YAP   

 run-      N3   
 time      data 
  JVM      SQL

Ontologies

Theories

Plugins

Test Cases

RDFCore test cases and results
OWL test cases and results
Euler1-2 test cases and results
Euler3 test cases and results
Euler4 test cases and results
Euler5 test cases and results
Euler5 backchain only test cases and results
Eye test cases and results
EyeS test cases and results
EyeJ test cases and results

Test Cases Performance Chart

Eye/EyeJ

Test Cases SHOULD

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

Conclusions

first support simple and then more complex systems
RDF and OWL enable optimal reuse of data in networked environment
a bit like going from cpu/memory/network/IOhardware to engines/triples/webservices/IOsoftware
or from avoid-hardware-wiring to avoid-software-wiring...
and promising for automatic software component generation

Jos De Roo
$Id: index.html 3170 2009-11-19 18:37:43Z josd $