EYE looking through N3 glasses

EYE stands for the euler.yap engine and it is an implementation of:

1/ an N3 parser written as Prolog DCG productions according to [1]
   and so far the full N3 parsing works fine and fast

2/ an N3 to PCL [2] compiler allowing existentials, disjuntions and
   false in the conclusion of rules and a typical test case is:

   RULES http://eulersharp.sourceforge.net/2007/07test/shubert.n3
   QUERY http://eulersharp.sourceforge.net/2007/07test/shubertQ.n3
   PROOF http://eulersharp.sourceforge.net/2007/07test/shubertE.n3

3/ proof tactics written in N3 and a more complex test case is:

   TACTS http://eulersharp.sourceforge.net/2007/07test/pd_hes_tactic.n3
   RULES http://eulersharp.sourceforge.net/2007/07test/pd_hes_theory.n3
   QUERY http://eulersharp.sourceforge.net/2007/07test/pd_hes_query.n3
   PROOF http://eulersharp.sourceforge.net/2007/07test/pd_hes_proof.n3

To run EYE only YAP, curl and euler.yap
(e.g. http://eulersharp.sourceforge.net/2006/02swap/euler.yap)
are required [3].

More test cases are in http://eulersharp.sourceforge.net/2006/02swap/etc
with test results http://eulersharp.sourceforge.net/2006/02swap/etc.ref
and it was tested on both Ubuntu, XP and OS-X.

Ultimately all the proofs should be fine with check.py
e.g. check http://eulersharp.sourceforge.net/2007/07test/witchE.n3
is happy right now, just as we are with N3 :-)

[1] http://www.w3.org/TeamSubmission/n3/
[2] http://eulersharp.sourceforge.net/GUIDE
[3] http://eulersharp.sourceforge.net/README

Thanks and kind regards, Jos

Jos De Roo | Agfa HealthCare
Senior Researcher | HE/Advanced Clinical Applications Research
T  +32 3444 7618
 http://www.agfa.com/w3c/jdroo/

Quadrat NV, Kortrijksesteenweg 157, 9830 Sint-Martens-Latem, Belgium
http://www.agfa.com/healthcare