Abstract: In this paper we define a two-rule reduction system for the lazy computation of unification on first-order terms. The computation consists of a sequence of reductions which is almost linear with the size of the input. Every reduction transforms the problem into an equivalent one which is a better approximation of the solution. The approach is based on a combinatorial system which provides abstractions for terms and term unification, and does not resort to any specific reduction control strategy. The abstraction on both data and control makes our system suitable in any applicative context where unification is required. (C) 1999 Academic Press.
Lazy Linear Combinatorial Unification
BELLIA, MARCO;OCCHIUTO, MARIA EUGENIA
1999-01-01
Abstract
Abstract: In this paper we define a two-rule reduction system for the lazy computation of unification on first-order terms. The computation consists of a sequence of reductions which is almost linear with the size of the input. Every reduction transforms the problem into an equivalent one which is a better approximation of the solution. The approach is based on a combinatorial system which provides abstractions for terms and term unification, and does not resort to any specific reduction control strategy. The abstraction on both data and control makes our system suitable in any applicative context where unification is required. (C) 1999 Academic Press.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.