Affiliation:
1. FB Informatik, Technische Universität Kaiserslautern, Kaiserslautern, Germany
Abstract
The Lexicographic Path Ordering (LPO) poses an interesting problem to the implementor: How to achieve a version that is both efficient and correct? The method of program transformation helps us to develop an efficient version step-by-step, making clear the essential ideas, while retaining correctness. By theoretical analysis we show that the worst-case behavior is thereby changed from exponential to polynomial. Detailed measurements show the practical improvements of the different variants. They allow us to assess experimentally various optimizations suggested for LPO.
Publisher
World Scientific Pub Co Pte Lt
Subject
Artificial Intelligence,Artificial Intelligence
Reference13 articles.
1. I. V. Ramakrishnan, R. Sekar and A. Voronkov, Handbook of Automated Reasoning II, eds. A. Robinson and A. Voronkov (Elsevier Science, 2001) pp. 1853–1964.
2. A Transformation System for Developing Recursive Programs
3. Rules and strategies for program transformation
4. Rewriting
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献