Skip to main content
SpringerLink
Log in

Parallel Completion Techniques

  • Conference paper
Symbolic Rewriting Techniques

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 15))

  • 360 Accesses

Abstract

We survey and categorize techniques for the parallelization of completion procedures. We cover both Knuth-Bendix term completion and Buchberger’s algorithm for Gröbner Basis completion. The survey includes a discussion of parallel installations of these algorithms in our own systems PaReDuX and GB/PARSAC, running on parallel desktop workstations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Avenhaus and J. Denzinger. Distributing equational theorem proving. In Kirchner [Kir93], pages 62-76.

    Google Scholar 

  2. Beatrice Amrhein, Oliver Gloor, and Wolfgang Küchlin. A case study of multi-threaded Gröbner basis completion. In Lakshmann Y. N., editor, Proc. 1996 International Symposium on Symbolic and Algebraic Computation: ISSAC′96, pages 95–102, Zurich, Switzerland, July 24–26 1996. ACM Press.

    Google Scholar 

  3. Giuseppe Attardi and Carlo Traverso. A strategy-accurate parallel Buchberger algorithm. In Hong [Hon94], pages 12-21.

    Google Scholar 

  4. Leo Bachmair and Nachum Dershowitz. Inference rules for rewrite-based first-order theorem proving. In Logic in Computer Science, pages 331–337. IEEE Computer Society Press, 1987. Proc. LICS′87, Ithaca, New York, June 22–25, 1987.

    Google Scholar 

  5. Leo Bachmair and Nachum Dershowitz. Critical pair criteria for completion. J. Symbolic Computation, 6(1):1–18, August 1988.

    Article  MathSciNet  MATH  Google Scholar 

  6. Leo Bachmair, Nachum Dershowitz, and David A. Plaisted. Completion without failure. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 2 of Rewriting Techniques, chapter 1. Academic Press, 1989.

    Google Scholar 

  7. Leo Bachmair and Harald Ganzinger. Buchberger’s algorithm: A constraint-based completion procedure. In Jean-Pierre Jouannaud, editor, Constraints in Computational Logics, volume 845 of LNCS, pages 285–301, Munich, Germany, September 1994. Springer-Verlag. (Proc. CCL′94).

    Google Scholar 

  8. Reinhard Bündgen, Manfred Göbel, and Wolfgang Küchlin. A finegrained parallel completion procedure. In Joachim von zur Gathen and Mark Giesbrecht, editors, Proc. 1994 International Symposium on Symbolic and Algebraic Computation: ISSAC′94, pages 269–277, Oxford, England, July 1994. ACM Press.

    Google Scholar 

  9. Reinhard Bündgen, Manfred Göbel, and Wolfgang Küchlin. Multithreaded AC term rewriting. In Hong [Hon94], pages 84-93.

    Google Scholar 

  10. Reinhard Bündgen, Manfred Göbel, and Wolfgang Küchlin. Parallel ReDuX → PaReDuX. In Jieh Hsiang, editor, Rewriting Techniques and Applications, 6th Intl. Conf., RTA-95, volume 914 of LNCS, pages 408–413, Kaiserslautern, Germany, April 1995. Springer-Verlag.

    Google Scholar 

  11. Reinhard Bündgen, Manfred Göbel, and Wolfgang Küchlin. A master-slave approach to parallel term rewriting on a hierarchical multiprocessor. In Jacques Calmet and Carla Limongelli, editors, Design and Implementation of Symbolic Computation Systems, volume. 1128 of LNCS, pages 183–194, Karlsruhe, Germany, September 1996. Springer-Verlag.

    Google Scholar 

  12. Reinhard Bündgen, Manfred Göbel, and Wolfgang Küchlin. Strategy compliant multi-threaded term completion. J. Symbolic Computation, 21(4-6):475–505, 1996.

    Article  MATH  Google Scholar 

  13. Maria Paola Bonacina and Jieh Hsiang. Distributed deduction by clause-diffusion: the Aquarius prover. In A. Miola, editor, Design and Implementation of Symbolic Computation Systems, volume 722 of LNCS, pages 272–287, Gmunden, Austria, September 1993. Springer-Verlag. (Int. Symp. DISCO′93).

    Google Scholar 

  14. Bruno Buchberger and Tudor Jebelean. Parallel rational arithmetic for computer algebra systems: Motivating experiments. Technical Report TR 92-29, RISC, Linz, Austria, 1992.

    Google Scholar 

  15. Bruno Buchberger and Rüdiger Loos. Algebraic simplification. In Computer Algebra: Symbolic and Algebraic Computation, volume 4 of Computing Supplementum, pages 11–43. Springer Verlag, Vienna, 2nd edition, 1982.

    Google Scholar 

  16. Maria Paola Bonacina and William W. McCune. Distributed theorem proving by peers. In Bundy [Bun94b], pages 841-846.

    Google Scholar 

  17. Reinhard Bündgen, Carsten Sinz, and Jochen Walter. ReDuX 1.5: New facets of rewriting. In Harald Ganzinger, editor, Rewriting Techniques and Applications, 7th Intl. Conf., RTA-96, volume 1103 of LNCS, New Brunswick, NJ, July 1996. Springer-Verlag.

    Google Scholar 

  18. Bruno Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal PhD thesis, Universität Innsbruck, 1965.

    Google Scholar 

  19. Bruno Buchberger. A criterion for detecting unnecessary reductions in the construction of Gröbner-Bases. In Edward W. Ng, editor, Symbolic and Algebraic Computation, volume 72 of LNCS, pages 3-21, Marseille, France, June 1979. Springer-Verlag. (Proc. EUROSAM′79).

    Google Scholar 

  20. Bruno Buchberger. Basic features and development of the Critical-Pair/Completion procedure. In Jean-Pierre Jouannaud, editor, Rewriting Techniques and Applications (Proc. RTA ′85), volume 202 of Lecture Notes in Computer Science, pages 1–45, Dijon, France, May 1985. Springer-Verlag.

    Google Scholar 

  21. Bruno Buchberger. Gröbner bases: An algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Recent Trends in Multidimensional Systems Theory, chapter 6. Reidel, 1985. (Also Report CAMP-83.29, U. Linz, 1983).

    Google Scholar 

  22. Bruno Buchberger. The parallel L-Machine for symbolic computation. In Caviness [Cav85], pages 541-542. (Proc. European Conference on Computer Algebra, Volume II: Research Contributions).

    Google Scholar 

  23. B. Buchberger. History and basic features of the critical-pair / completion procedure. J. Symbolic Computation, 3(1&2):3–38, Febru-ary&April 1987.

    Google Scholar 

  24. Bruno Buchberger. The parallelization of critical-pair / completion procedures on the L-Machine. Technical Report TR 87-12, RISC, Linz, Austria, 1987. (Also in: Japanese Symp. Functional Programming, pp. 54-61, Feb. 1987).

    Google Scholar 

  25. Reinhard Bündgen. Completion of integral polynomials by AC-term completion. In Watt [Wat91], pages 70-78.

    Google Scholar 

  26. Reinhard Bündgen. Reduce the redex → ReDuX. In Kirchner [Kir93], pages 446-450.

    Google Scholar 

  27. Reinhard Bündgen. On pots, pans and pudding or how to discover generalized critical pairs. In Bundy [Bun94b], pages 693-707.

    Google Scholar 

  28. Alan Bundy, editor. Automated Deduction—CADE-12, volume 814 of LNCS, Nancy, France, July 1994. Springer-Verlag.

    MATH  Google Scholar 

  29. Reinhard Bündgen. Buchberger’s algorithm: the term rewriter’s point of view. Theoretical Computer Science, 159(2):143–190, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  30. Reinhard Bündgen. Proof transformation for non-compatible rewriting. In Jaques Calmet, John A. Campbell, and Jochen Pfalzgraf, editors, Artificial Intelligence and Symbolic Mathematical Computing, volume 1138 oi LNCS, pages 160–175, Steyr, Austria, September 1996. Springer-Verlag. (Intl. Conf. AISMC-3).

    Chapter  Google Scholar 

  31. Reinhard Bündgen. Symmetrization based completion. In Symbolic Rewriting Techniques, M. Bronstein, J. Grabmeier, V. Weispfenning (Eds.), Birkhäuser Basel, 1998.

    Google Scholar 

  32. Thomas Becker and Volker Weispfenning. Grobner Bases, a Computational Approach to Commutative Algebra. Springer-Verlag, 1993.

    Google Scholar 

  33. B. F. Caviness, editor. Eurocal′85, volume 204 of LNCS, Linz, Austria, April 1985. Springer-Verlag. (Proc. European Conference on Computer Algebra, Volume II: Research Contributions).

    Google Scholar 

  34. Soumen Chakrabarti and Katherine Yelick. Implementing an irregular application on a distributed memory multiprocessor. In PPOPP [PPO93], pages 169-178. (Also SIGPLAN Notices 28(7)).

    Google Scholar 

  35. S. R. Czapor. Solving algebraic equations: Combining Buchberger’s algorithm with multivariate factorization. J. Symbolic Computation, 7:49–53, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  36. S. R. Czapor. A heuristic selection strategy for lexicographic Gröbner bases? In Watt [Wat91], pages 39-48.

    Google Scholar 

  37. James H. Davenport. Looking at a set of equations. Technical Report 87-06, University of Bath, Bath, England, 1987.

    Google Scholar 

  38. J. Delia Dora and J. Fitch, editors. Computer Algebra and Parallelism. Computational Mathematics and Applications. Academic Press, London, 1989. (Proc. CAP′88, Grenoble, France, June 1988).

    Google Scholar 

  39. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Formal Models and Semantics, volume 2 of Handbook of Theoretical Computer Science, chapter 6. Elsevier, 1990.

    Google Scholar 

  40. Nachum Dershowitz and Naomi Lindenstrauss. An abstract concurrent machine for rewriting. In H. Kirchner and W. Wechler, editors, Algebraic and logic programming: Second international conference, volume 463 of LNCS, pages 318–331, Nancy, Prance, October 1990. Springer-Verlag.

    Google Scholar 

  41. J.C. Faugère. Parallelization of Gröbner basis. In Hong [Hon94], pages 124-132.

    Google Scholar 

  42. B. Fronhöfer and G. Wrightson, editors. Parallelization in Inference Systems, volume 590 of LNAI, Dagstuhl Castle, Germany, December 1990. Springer-Verlag.

    Google Scholar 

  43. John V. Guttag and James J. Horning. Larch: Languages and Tools for Formal Specification. Springer-Verlag, New York, 1993.

    Book  MATH  Google Scholar 

  44. Hans-Gert Gräbe and Wolfgang Lassner. A parallel Gröbner factorizer. In Hong [Hon94], pages 174-180.

    Google Scholar 

  45. R. Gebauer and H.M. Möller. On an installation of Buchberger’s algorithm. J. Symbolic Computation, 6(2 & 3):275–286, October/December 1988.

    Article  MATH  Google Scholar 

  46. Alessandro Giovini, Teo Mora, Gianfranco Niesi, Lorenzo Robbiano, and Carlo Traverso. “One sugar cube, please;” or: Selection strategies in the Buchberger algorithm. In Watt [Wat91], pages 49-54.

    Google Scholar 

  47. David J. Hawley. A Buchberger algorithm for distributed memory multi-processors. In H.P. Zima, editor, Parallel Computation (1st Internatl ACPC Conf.), volume 591 of LNCS, pages 385–390, Salzburg, Austria, October 1991. Springer-Verlag.

    Google Scholar 

  48. Hoon Hong, editor. First Intl. Symp. Parallel Symbolic Computation PASCO′94, volume 5 of Lecture Notes Series in Computing, Linz, Austria, September 1994. World Scientific.

    Google Scholar 

  49. Jean-Pierre Jouannaud and Hélène Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. on Computation, 15:1155–1194, November 1986.

    Article  MathSciNet  MATH  Google Scholar 

  50. Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra. Pergamon Press, 1970. (Proc. of a conference held in Oxford, England, 1967).

    Google Scholar 

  51. C. Kirchner, editor. Rewriting Techniques and Applications, volume 690 of LNCS, Montreal, Canada, June 1993. Springer-Verlag.

    MATH  Google Scholar 

  52. J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Background: Computational Structures, volume 2 of Handbook of Logic in Computer Science, chapter 1, pages 1–116. Oxford University Press, 1992.

    Google Scholar 

  53. Claude Kirchner, Christopher Lynch, and Christelle Scharff. Finegrained concurrent completion, 1996.

    Google Scholar 

  54. Deepak Kapur, David R. Musser, and Paliath Narendran. Only prime superpositions need be considered in the Knuth-Bendix completion procedure. J. Symbolic Computation, 6(1):19–36, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  55. Heinz Kredel. Computer algebra on a KSR1 parallel computer, 1994.

    Google Scholar 

  56. Wolfgang Küchlin. A confluence criterion based on the generalised Newman Lemma. In Caviness [Cav85], pages 390-399. (Proc. European Conference on Computer Algebra, Volume II: Research Contributions).

    Google Scholar 

  57. Wolfgang Küchlin. Inductive completion by ground proof transformation. In H. Aït-Kaci and M. Nivat, editors, Rewriting Techniques, volume II of Resolution of Equations in Algebraic Structures, chapter 7, pages 211-244. Academic Press, August 1989.

    Google Scholar 

  58. Claude Kirchner and Patrick Viry. Implementing parallel rewriting. In Fronhöfer and Wrightson [FW90], pages 123-138.

    Google Scholar 

  59. Wolfgang W. Küchlin and Jeffrey A. Ward. Experiments with virtual C Threads. In Proc. Fourth IEEE Symp. on Parallel and Distributed Processing, pages 50–55, Dallas, TX, December 1992. IEEE Press.

    Chapter  Google Scholar 

  60. Dallas Lankford and A. M. Ballantyne. Decision procedures for simple equational theories with commutative-associative axioms: Complete sets of commutative-associative reductions. Technical Report Report ATP-39, Department of Mathematics and Computer Sciences, University of Texas, Austin, August 1977.

    Google Scholar 

  61. Ewing L. Lusk and William W. McCune. Experiments with ROO, a parallel automated deduction system. In Fronhöfer and Wrightson [FW90], pages 139-162.

    Google Scholar 

  62. William W. McCune. OTTER 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439-4801, 1994.

    Google Scholar 

  63. Herbert Melenk and Winfried Neun. Parallel polynomial operations in the large Buchberger algorithm. In Delia Dora and Fitch [DDF89], pages 143-158. (Proc. CAP′88, Grenoble, France, June 1988).

    Google Scholar 

  64. W. Neun and H. Melenk. Very large Groebner basis calculations. In Zippel [Zip92], pages 89-100. (Proc. CAP′90, Ithaca, NY, May 1990).

    Google Scholar 

  65. David Plaisted. Equational reasoning and term rewriting systems. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Logical Foundations, volume 1 of Handbook of Logic in Artificial Intelligence and Logic Programming, chapter 5. Oxford University Press, 1993.

    Google Scholar 

  66. Carl G. Ponder. Parallelism and algorithms for algebraic manipulation: Current work. ACM SIGSAM Bull., 22(3):7–14, July 1988.

    Article  MATH  Google Scholar 

  67. 4th PPOPP, San Diego, CA, May 1993. ACM Press. (Also SIGPLAN Notices 28(7)).

    Google Scholar 

  68. G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28:223–264, 1981.

    Article  MathSciNet  Google Scholar 

  69. Stephen A. Schwab. Extended parallelism in the Gröbner Basis algorithm. Int. J. of Parallel Programming, 21(1):39–66, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  70. P. Sénéchaud. Implementation of a parallel algorithm to compute a Groebner basis on boolean polynomials. In Delia Dora and Fitch [DDF89], pages 159-166. (Proc. CAP′88, Grenoble, France, June 1988).

    Google Scholar 

  71. P. Sénéchaud. Boolean Groebner bases and their MIMD implementation. In Zippel [Zip92], pages 101-115. (Proc. CAP′90, Ithaca, NY, May 1990).

    Google Scholar 

  72. Kurt Siegl. Parallelizing algorithms for symbolic computation using ||MAPLE||. In PPOPP [PPO93], pages 179-186. (Also SIGPLAN Notices 28(7)).

    Google Scholar 

  73. J. K. Slaney and E. L. Lusk. Parallelizing the closure computation in automated deduction. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, volume 449 of LNCS, pages 28–39, Kaiserslautern, Germany, July 1990. Springer-Verlag.

    Google Scholar 

  74. C.B. Suttner and J. Schumann. Parallel automated theorem proving. In L. Kanal, V. Kumar, H. Kitano, and C.B. Suttner, editors, Parallel Processing for Artificial Intelligence I, pages 209–257. Elsevier, Amsterdam, 1994.

    Google Scholar 

  75. Hiroyuki Sawada, Satoshi Terasaki, and Akira Aiba. Parallel computation of Gröbner Bases on distributed memory machines. J. Symbolic Computation, 18(3):207–222, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  76. Karel Stokkermans. A Categorical Framework and Calculus for Critical-Pair Completion. PhD thesis, Research Institute for Symbolic Computation, Johannes-Kepler-Universität, Linz, 1995.

    Google Scholar 

  77. Jean-Philippe Vidal. The computation of Gröbner bases on a shared memory multiprocessor. In A. Miola, editor, Design and Implementation of Symbolic Computation Systems, volume 429 of LNCS, pages 81–90, Capri, Italy, April 1990. Springer-Verlag. (Int. Symp. DISCO′90).

    Chapter  Google Scholar 

  78. Stephen M. Watt. Bounded Parallelism in Computer Algebra. PhD thesis, University of Waterloo, Waterloo, Canada, 1986. Also Technical Report CS-86-12.

    Google Scholar 

  79. Stephen M. Watt, editor. Proc. 1991 International Symposium on Symbolic and Algebraic Computation: ISS AC′91, Bonn, Germany, July 1991. ACM Press.

    Google Scholar 

  80. Franz Winkler and Bruno Buchberger. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm. In Proc. Colloquium on Algebra, Combinatorics and Logic in Computer Science. J. Bolyai Math. Soc., J. Bolyai Math. Soc. and North-Holland, 1985. (Colloquium Mathematicum Societatis J. Bolyai, Györ, Hungary, 1983).

    Google Scholar 

  81. Mark Weiser, Alan Demers, and Carl Hauser. The portable common runtime approach to interoperability. In 12th ACM SOSP, pages 114-122, 1989.

    Google Scholar 

  82. Franz Winkler. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm. Tech. Report 83-14.0, CAMP, Universität Linz, Linz, Austria, May 1983.

    Google Scholar 

  83. Katherine A. Yelick and Stephen J. Garland. A parallel completion procedure for term rewriting systems. In Deepak Kapur, editor, Automated Deduction—CADE-11, volume 607 of LNCS, pages 109–123, Saratoga Springs, NY, June 1992. Springer-Verlag.

    Google Scholar 

  84. Richard Zippel, editor. Computer Algebra and Parallelism, volume 584 of LNCS, Ithaca, NY, March 1992. Springer-Verlag. (Proc. CAP′90, Ithaca, NY, May 1990).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut, Universität Tübingen, Sand 13, D-72076, Tübingen, Germany

    Beatrice Amrhein, Reinhard Bündgen & Wolfgang Küchlin

Authors
  1. Beatrice Amrhein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reinhard Bündgen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wolfgang Küchlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA, 2004, Route des lucioles, BP 93, 06902, Sophia Antipolis Cedex, France

    Manuel Bronstein

  2. FMI Universität Passau, 94030, Passau, Germany

    Volker Weispfenning

  3. IBM Deutschland Informationssysteme GmbH, Postfach 10 30 68, 69020, Heidelberg, Germany

    Johannes Grabmeier

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Basel AG

About this paper

Cite this paper

Amrhein, B., Bündgen, R., Küchlin, W. (1998). Parallel Completion Techniques. In: Bronstein, M., Weispfenning, V., Grabmeier, J. (eds) Symbolic Rewriting Techniques. Progress in Computer Science and Applied Logic, vol 15. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8800-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8800-4_1

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9779-2

  • Online ISBN: 978-3-0348-8800-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation