Unification with Flexible Arity Symbols: a Typed Approach
نویسندگان
چکیده
In this paper we extend unification of terms with flexible arity function symbols with regular expression operators such as repetition (*), alternation, etc, that are used as types allowing a compact representation of terms with functors with an arbitrary number of arguments. This new unification can then be used to unify subterms in the middle of complexes sequences of terms leading to a quite simple representation of sequences of arguments.
منابع مشابه
Pattern Unification with Sequence Variables and Flexible Arity Symbols
A unification procedure for a theory with individual and sequence variables, free constants, free fixed and flexible arity function symbols and patterns is described. The procedure enumerates a set of substitution/constraint pairs which constitutes the minimal complete set of unifiers.
متن کاملUnification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms
A minimal and complete unification procedure for a theory with individual and sequence variables, free constants and free fixed and flexible arity function symbols is described and a brief overview of an extension with pattern-terms is given.
متن کاملPattern Unification with Sequence Variables, Flexible Arity Symbols
A unification procedure for a theory with individual and sequence variables, free constants, free fixed and flexible arity function symbols and patterns is described. The procedure enumerates a set of substitution/constraint pairs which constitutes the minimal complete set of unifiers.
متن کاملXML Processing and Logic Programming
In this paper we describe a constraint solving module which we call CLP(Flex), for dealing with the unification of terms with flexible arity function symbols. This approach results in a flexible and high declarative model for XML processing.
متن کاملCLP(Flex): Constraint Logic Programming Applied to XML Processing
In this paper we present an implementation of a constraint solving module, CLP(Flex), for dealing with unification in an equality theory for terms with flexible arity function symbols. Then we present an application of CLP(Flex) to XML-processing where XML documents are abstracted by terms with flexible arity symbols. This gives a highly declarative model for XML processing yielding a substanti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006