Hi, I am now at the inference and firing of rules in the unter theorem prover parser. Later on, that one will be used for the Scheme theorem prover built on top of it.
I have just a recognition of and, or, not, which I have to match using e.g. prolog variables in the form of ?x, ?y, ?p, ?q, ?r, ...
I cut the word and, or, not then must proceed to matching rules/validities.
The code of the latest version is at : sf.net/projects/gremlin-scheme/files//
I have just a recognition of and, or, not, which I have to match using e.g. prolog variables in the form of ?x, ?y, ?p, ?q, ?r, ...
I cut the word and, or, not then must proceed to matching rules/validities.
The code of the latest version is at : sf.net/projects/gremlin-scheme/files//
