Sciweavers

JACM
2007
84views more  JACM 2007»
13 years 3 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
DASFAA
2007
IEEE
151views Database» more  DASFAA 2007»
13 years 7 months ago
On Label Stream Partition for Efficient Holistic Twig Join
Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme...
Bo Chen, Tok Wang Ling, M. Tamer Özsu, Zhenzh...
CTRS
1992
13 years 7 months ago
Path Orderings for Termination of Associative-Commutative Rewriting
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," sufficesfor establishing terminat...
Nachum Dershowitz, Subrata Mitra
CADE
2005
Springer
14 years 3 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
CADE
2006
Springer
14 years 3 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema