\section{Euler}
Euler is a different implementation of Notation3 and Notation3 rules. It is implemented as a backward chainer, with euler path detection to break trivial loops. It has versions written in Java and C\#, as well as less complete versions in Prolog and Python. It typically generates proofs rather than simply results. Euler's parser of N3 is not complete, and given junk will happily spit out junk. Euler has no mechanism for checking the proofs it generates.

