A confluence criterion based on the generalised Newman Lemma
In order to improve the efficiency of the Knuth-Bendix Algorithm by eliminating unnecessary reductions, a criterion predicting confluence of critical pairs was given by Winkler in 1983. Subsequently, Winkler and Buchberger also presented a more general form of Newman's Lemma. We derive a more general confluence criterion directly from the Generalised Newman Lemma and integrate it into the Knuth-Bendix Algorithm with the aim of generating fewer critical pairs. With the new criterion it is possible to give a concise justification for the removal of reducible rules in the KB-algorithm. A slightly specialised version of this criterion needs only a single match to test for; empirical results substantiate the claim of a considerable gain in efficiency for the Knuth-Bendix Algorithm.
KeywordsStep Stone Reducible Rule Critical Pair Confluence Criterion Completion Process
Unable to display preview. Download preview PDF.
- [Bu 70]Buchberger, B. Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes math. 4, 3 (1970).Google Scholar
- [Bu 79]Buchberger, B. "A Criterion for Detecting Unnecessary Reductions in the Construction of Gröbner-Bases." In Symbolic and Algebraic Computation (E. Ng ed.). Lecture Notes in Computer Science, vol. 72. Springer-Verlag 1979.Google Scholar
- [Bu 84]Buchberger, B. "A critical pair/ completion algorithm for finitely generated ideals in rings." In Logic and Machines: Decision Problems and Complexity (Proceedings of the Symposium "Rekursive Kombinatorik", Münster, May 23–28, 1983), E. Börger ed., Lecture Notes in Computer Science, vol. 171, Springer-Verlag 1984.Google Scholar
- [Hu 80]Huet, G. Confluent reductions: abstract properties and their applications to term rewriting systems. Journ. ACM 27, 4 (Oct 1980).Google Scholar
- [Hu 81]Huet, G. A complete proof of correctness of the Knuth-Bendix Completion Algorithm. Journ. Comp. Syst. Sci. 23 (1981) 11–21.Google Scholar
- [Hu&Op 80]Huet, G., and Oppen, D. "Equations and rewrite rules: A survey." In Formal Languages: Perspectives and Open Problems (R. Book ed.). Academic Press 1980.Google Scholar
- [Kn&Be 70]Knuth, D. E., and Bendix, P. B. "Simple word problems in universal algebra." In Computational Problems in Abstract Algebra (Proceedings of a conference held in Oxford 1967, J. Leech ed.). Pergamon 1970.Google Scholar
- [Kü 82]Küchlin, W. W. "A Theorem-Proving approach to the Knuth-Bendix Completion Algorithm." In Computer Algebra (Proceedings of EUROCAM'82), J. Calmet ed., Lecture Notes in Computer Science, vol. 144. Springer-Verlag 1982.Google Scholar
- [Kü 82a]Küchlin, W. W. An Implementation and Investigation of the Knuth-Bendix Completion Procedure. Diplomarbeit, Fakultät für Informatik, Universität Karisruhe, West Germany, 1982.Google Scholar
- [Ro 65]Robinson, J. A. A machine oriented logic based on the resolution principle. Journ. ACM 12, 1 (Jan 1965).Google Scholar
- [Wi 83]Winkler, F. A criterion for eliminating unnecessary reductions in the Knuth-Bendix Algorithm. Tech. Report 83-14.0, CAMP, Universität Linz, Austria, May 1983.Google Scholar
- [Wi&Bu 83]Winkler, F., and Buchberger, B. "A criterion for eliminating unnecessary reductions in the Knuth-Bendix Algorithm." Colloquium on Algebra, Combinatorics and Logic in Computer Science (Györ, Hungary, Sept 12–16, 1983).Google Scholar