SWIG implementation experience in Euler
by Jos De Roo of AGFA
- EulerSharp is an inference
engine supporting logic based proofs of test cases (*).
- It is a backward-chaining reasoner enhanced with Euler path detection and will tell
you whether a given set of facts and rules supports a given conclusion.
- using as much as possible from DanC's and TimBL's SWAP
- implemented in Java, C# and Python
- making use of Jena-2.1 in RDF/XML to N3 triples generation (but have to dig into DIG)
- small footprint (engine is 30 Kbyte jar file) and have achieved > .5 Msteps/sec
(*) Test cases have a THIS part and a THAT part such that assuming the THIS part implies the THAT part.|
Test cases have explicit assumptions because assumptions should be checked.
Test cases make issues observable (both issues w.r.t. requirements and designissues).
Test cases lead to test results which are one of passing, failing, undecided or no-data.
Test cases can be in the following state: proposed, approved, extra-credit or obsoleted.
- 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