Today was spent by continued debugging of the parser. Yesterday, I ended on the UnifyingResolutions class throwing an exception informing me that I couldn't resolve those nodes; today, that was corrected, but only to introduce new errors; in this case an infinite loop that occurs in the Martelli-Montanari algorithm for computing unifiers. So far, I can't quite find the fix, and so while I spent a lot of time on it, I also spent some time reading relevant literature as well. In particular, I found the original Martelli-Montanari paper [1] and read some of that (which was not helpful so far), a document on how LowerUnits might be generalized, and re-read background literature like [2,3].
[1] Martelli, Alberto, and Ugo Montanari. "An efficient unification algorithm." ACM Transactions on Programming Languages and Systems (TOPLAS) 4.2 (1982): 258-282.
[2] Fontaine, Pascal, Stephan Merz, and Bruno Woltzenlogel Paleo. "Compression of propositional resolution proofs via partial regularization." Automated Deduction–CADE-23. Springer Berlin Heidelberg, 2011. 237-251.
[3] Leitsch, Alexander. "Resolution theorem proving: A logical point of view." Logic Colloquium. Vol. 1. 2001.
No comments:
Post a Comment