Thursday, 22 May 2014

Day 2: Parsers, Part III

Today was continued development of the SPASS parser that I've been working on for the last two days. Progress is being made: the issues I had yesterday for example, (with respect to n-ary functions and their representation) have been resolved through AppRec which uses currying to deal with such functions. As a result, I think I was able to correctly store such expressions in memory, and this allowed me to deal with working with those expressions in memory. In particular lines of the proofs that use inference rules can, for example, be parsed, or computed from the axioms already parsed into Skeptik (or both, to say, check for errors). So today was refactoring the code so that it does the latter and uses UnifyingResolutions to compute the resolution based on the referenced lines in the proof.

This took admittedly longer than I had expected, and it's still not quite working. It compiles, but outputs an exception "Resolution: the conclusions of the given premises are not resolvable.", which is obviously not good. I've been toying around and investigating, and now I'm pretty sure it's my code (not the UnifyingResolutions class, which has not been tested). The function calls for a Set[Var] of unifying variables, and right now I think I'm just passing in an empty place holder (but that variable is also implicitly defined, so I'm not sure if I need to be passing in anything at all--though that results in the compiler errors). Will replace the placeholder with something useful tomorrow, and see if that works.

No comments:

Post a Comment