OWL implementation experience in Euler

2003-01-09

http://www.agfa.com/w3c/Talks/2003/01webont/Overview.html

by Jos De Roo of AGFA

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

N3 descriptions

• for RDFS http://www.agfa.com/w3c/euler/rdfs-rules
• for XSD http://www.agfa.com/w3c/euler/xsd-rules
• for OWL http://www.agfa.com/w3c/euler/owl-rules
• ...

Testcases

• bundled in etc5
• 108 testcases (including the 71 OWL tests)
• 814 documents are loaded from 4 sites (W3C, ILRT, RPI, AGFA)
• 218 engines involved and taking 1.1 Msteps
• 7 testcases with "no proof found"
• results in etc5-proof

Conclusions

• first support simple and then more complex systems
• OWL enables optimal reuse of data in networked environment
• will try that next for LLDM testcase