Completion of integral polynomials by AC-term completion

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Completion of integral polynomials by AC-term completion

Full text

Pdf (910 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1991 international symposium on Symbolic and algebraic computation table of contents

Bonn, West Germany

Pages: 70 - 78

Year of Publication: 1991

ISBN:0-89791-437-6

Author

Reinhard Bündgen

Wilhelm-Schickard-Institut, Universität Tübingen, D-7400 Tübingen, Fed. Rep. of Germany

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 9, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120704 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	BD89	L. Bachmair , Nachum Dershowitz, Completion for rewriting modulo a congruence, Theoretical Computer Science, v.67 n.2-3, p.173-201, Oct. 1989 [doi>10.1016/0304-3975(89)90003-0]
	BL82	Bruno Buchberger and Rfidiger Logs. Algebraic simplification. In Computer Algebra, pages 14-43, Springer-Verlag, 1982.
	Buc65	Bruno Buchberger. Ein Algorithmus zum A uffinden der Basiselemente des Restklassentinges nach einem nulldimensionalen Polynomideal. PhD thesis, Universit~t Innsbruck, 1965.
	Buc84	Bruno Buchberger, A critical-pair/completion algorithm for finitely generated ideals in rings, Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity, p.137-161, May 23-28, 1983
	Buc85	Bruno Buchberger. GrSbner 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).
	Bün90	Reinhard Biindgen. Completion of Bases for Multivariate Polynomials over Commutative Rings with the Term Completion Procedure According to Peterson and Stickel. Technical Report 90-8, Wilhelm-Schickard-Institut, Universit~t Tiibingen, D-7400 Tiibingen, 1990.
	Bün91	Reinhard Bündgen, Simulating Buchberger's algorithm by Knuth-Bendix completion, Proceedings of the 4th international conference on Rewriting techniques and applications, p.386-397, March 1991, Como, Italy
	Der79	Nachum Dershowitz. A note on simplification orderings. Inf. Proc. Letters, 9:212-215, 1979.
	Der89	Nachum Dershowitz. Completion and its applications. In H. Ait-KeLci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, chapter 2, Academic Press, 1989.
	JK86	Jean-Pierre Jouannaud , Hélène Kirchner, Completion of a set of rules modulo a set of equations, SIAM Journal on Computing, v.15 n.4, p.1155-1194, Nov. 1986 [doi>10.1137/0215084]
	KB70	Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebra. In 3. Leech, editor, Computational Problems in Abstract Algebra, Pergamon Press, 1970. (Proc. of a conference held in Oxford, England, 1967).
	KKN85	Abdelilah Kandri-Rody , Deepak Kapur , Paliath Narendran, An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras, Proc. of the first international conference on Rewriting techniques and applications, p.345-364, December 1985, Dijon, France
	KKW89	F. Winkler, Knuth-Bendix procedure and Buchberger algorithm: a synthesis, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.55-67, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74548]
	Lau76	Markus Lauer. Kanonische Repra'sentanten fiir die Restklassen nach einem Polynom. Master's thesis, Universit~t Kaiserslautern, 1976.
	LC86	Philippe Le Chenadec. Canonical Forms in Finitely Presented Algebras. Pitman, London, 1986.
	Les83	Pierre Lescanne, Computer experiments with the REVE term rewriting system generator, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.99-108, January 24-26, 1983, Austin, Texas [doi>10.1145/567067.567078]
	Loo81	Rüdiger Loos, Term Reduction Systems and Algebraic Algorithms, Proceedings of the German Workshop on Artificial Intelligence, p.214-234, January 26-31, 1981
	PS81	Gerald E. Peterson , Mark E. Stickel, Complete Sets of Reductions for Some Equational Theories, Journal of the ACM (JACM), v.28 n.2, p.233-264, April 1981 [doi>10.1145/322248.322251]
	Sti81	Mark E. Stickel, A Unification Algorithm for Associative-Commutative Functions, Journal of the ACM (JACM), v.28 n.3, p.423-434, July 1981 [doi>10.1145/322261.322262]