๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Algorithm for General Set Unification and Its Complexity

โœ Scribed by Frieder Stolzenburg

Book ID
110231346
Publisher
Springer Netherlands
Year
1999
Tongue
English
Weight
139 KB
Volume
22
Category
Article
ISSN
0168-7433

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for inversing a unification
An algorithm for inversing a unification parser into an efficient unification generator
โœ Tomek Strzalkowski ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 338 KB

An algorithm that inverses a unifkaticn parser written in FXOLOG into a generator for naNd language is presented. Some aspects of applicability of the algorithm arc discussed. ' MSEA'S of basic predicates, such as mncat. art assumed to k known apriori; MSEA'S for recunive predicates are first comput

An Algorithm for Finding Recurrence Rela
An Algorithm for Finding Recurrence Relations of Binomial Sums and its Complexity
โœ Nobuki Takayama ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 355 KB

A new algorithm to find recurrence relations of binomial sums and a complexity analysis are given. The algorithm is based on the theory of hypergeometric functions and algorithmic method to get contiguity relations of hyperegeometric functions.