Euler proof mechanism

Version 23.066 by Jos De Roo of AGFA

Problem

Generate a proof for a question about a given set of facts and rules.
For the authentication example you can find who is authenticated in authen.proof.rdf.
For the graph example you can find a proof for the path question in graph.proof.rdf.
For the lists example you can see the proof of the list append question in lists.proof.rdf.

Concept

The facts and rules are acquired from the Web and translated into a kind of logic program. The proof engine only follows Euler paths (the concept Euler found several hundred years ago) so that endless deductions are avoided. That means that no special attention have to be paid to recursions or to graph merging.

Implementation

History

jos.deroo.jd@belgium.agfa.com