Examples of Running Code
Closed World Machine
Euler Proof Mechanism
- research component to support logic based proofs.
- Prolog unification (substitutions, unifiers) & resolution algorithm & backtracking
- Euler path detection
- "existential introduction rule" generation (w.r.t. RDF bNodes)
- unification of variable predicates
- use as much as possible from DanC's and TimBL's SWAP