Logicality of conditional rewrite systems

Authors:
Toshiyuki Yamada;Jürgen Avenhaus;Carlos Loría-Sáenz;Aart Middeldorp
Affiliations:
Univ. of Tsukuba, Tsukuba, Japan;Univ. Kaiserslauter, Kaiserslautern, Germany;Instituto Technologico de Costa Rica Cartago, Costa Rico;Univ. of Tsukuba, Tsukuba, Japan
Venue:
Theoretical Computer Science - Trees in algebra and programming
Year:
2000

Simplifying termination proofs for rewrite systems by preprocessing

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
On a Generalised Logicality Theorem

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
New completeness results for lazy conditional narrowing

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Shallow confluence of conditional term rewriting systems

Journal of Symbolic Computation

Hi-index	0.00