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

Permutation rewriting and algorithmic verification

โœ Scribed by Ahmed Bouajjani; Anca Muscholl; Tayssir Touili

Book ID
113641617
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
371 KB
Volume
205
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Permutative rewriting and unification
Permutative rewriting and unification
โœ Thierry Boy de la Tour; Mnacho Echenim ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 453 KB
Algorithms and reductions for rewriting
Algorithms and reductions for rewriting problems. II
โœ Rakesh Verma ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 86 KB

In this paper we give polynomial-time reductions between a version of joinability for rewrite systems and the word problem for rewrite systems. We prove log-space hardness or completeness for P for several problems of ground rewrite systems. We show that matching (and unification) modulo ground equa

Expressive capabilities description lang
Expressive capabilities description languages and query rewriting algorithms
โœ Vasilis Vassalos; Yannis Papakonstantinou ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 673 KB

Information integration systems have to cope with a wide variety of dierent information sources, which support query interfaces with very varied capabilities. To deal with this problem, the integration systems need descriptions of the query capabilities of each source, i.e., the set of queries suppo