Order-Sorted Rigid E-Unification

69 Pages Posted: 31 Oct 2008

See all articles by Jean H. Gallier

Jean H. Gallier

affiliation not provided to SSRN

Tomas Isakowitz

affiliation not provided to SSRN

Date Written: December 1991

Abstract

Rigid E-Unification is a special type of unification which arises naturally whenextending Andrew's method of matings to logic with equality. We study the rigid E-Unificationproblem in the presence of subsorts. We present an order sorted methodfor the computation of order sorted rigid-E-unifiers. The method is based on an unsortedone which we refine and extend to handle sort information. Our approach is toincorporate the sort information within the method so as to leverage it. We show viaexamples how the order sorted method is able to detect failures due to sort conflictsat an early stage in the construction of potential rigid E Unifiers. The algorithm presentedhere is NP-complete, as is the unsorted one. This is significant, specially due tothe complications presented by the sort information.

Suggested Citation

Gallier, Jean H. and Isakowitz, Tomas, Order-Sorted Rigid E-Unification (December 1991). NYU Working Paper No. IS-91-40, Available at SSRN: https://ssrn.com/abstract=1289069

Jean H. Gallier (Contact Author)

affiliation not provided to SSRN

No Address Available

Tomas Isakowitz

affiliation not provided to SSRN

No Address Available

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
52
Abstract Views
484
Rank
687,751
PlumX Metrics