Running Code
- Euler Proof Mechanism is a
research component to support logic based proofs
- using Prolog unification (substitutions, unifiers) & resolution algorithm & backtracking
- plus Euler path detection to avoid endless deductions
- using as much as possible from DanC's and TimBL's SWAP
- implemented in Java and also in C#
- making use of Jena2 in RDF/XML to N3 triples generation
- small footprint (engine is 28 Kbyte jar file) and have achieved > .5 Msteps/sec
