Thursday, 19 June 2014

Extending LowerUnits to First Order

Yesterday, I coded the first version of LowerUnits for first order logic proofs. It's based on the conjecture that was supplied in my notes, minus the requirement that the unit being lowered is the most general form. I was also going to write up a proof that the conjectured conditions for lowering units would always work, but I discovered an error in it and I haven't yet corrected it. Today I'll continue to develop the LU algorithm, and get this proof corrected & typed up.

I also cleaned up a few things in UnifyingResolution - so Bruno, if you want to look at how we could refactor that class so that I don't need to pass in an extra argument in the constructor, now you can.

No comments:

Post a Comment