Thursday, 29 May 2014

Unifying Resolutions - Continued

(This post was supposed to go up yesterday, but it did not -- though it was posted on the Google group)

Today, I've been debugging a different problem: the resolvents we get are very close to those output by SPASS, but appear to be off in terms of where variables appear, e.g.:
First premise:  ⊢ (le U U)
First formula: (le U U)
Second premise: (le (max U V) W) ⊢ (le V W)
Second formula: (le (max U V) W)
Parsed: 10: ⊢ (le U (max V U))
Computed: 10: ⊢ (le V (max U V))

but unfortunately, not always, e.g.:
First premise:  ⊢ (le U U)
First formula: (le U U)
Second premise: (le (max U V) W) ⊢ (le U W)
Second formula: (le (max U V) W)
Parsed: 13: ⊢ (le U (max U V))
Computed: 13: ⊢ (le U (max U V))

But should this even be a concern, considering all the variables are universally quantified, and we can just rename them when doing resolution? And in some cases, this does not seem to be an issue: sometimes, UnifyingResolution can deal with the different names, e.g.

Attempting to parse line 18
First premise:  ⊢ (le U (max NEW1 (max U V)))
First formula: (le U (max V (max U W)))
Second premise: (le (max U V) W) ⊢ (le U W)
Second formula: (le (max U V) W)
Parsed: 18: ⊢ (le U (max V (max (max U W) X)))
Computed: 18: ⊢ (le U (max NEW1 (max (max U V) NEW0)))

but of course we get new variables in the end result.

And in other cases it does not work:

Attempting to parse line 44
First premise:  ⊢ (le V (max U V))
First formula: (le U (max V U))
Second premise: (eq (f V) 3), (eq (f U) 3), (le (s U) V) ⊢ 
Second formula: (le (s U) V)
Exception in thread "main" java.lang.Exception: Resolution: the conclusions of the given premises are not resolvable.

So if the variable names are not an issue, there might be an issue in finding unifying pairs (so the Martelli Montanari algorithm again?). I'm looking into this now.

And I should note that the filtering issue has been fixed.

No comments:

Post a Comment