×

A Noetherian and confluent rewrite system for idempotent semigroups. (English) Zbl 0493.68087


MSC:

68T99 Artificial intelligence
20M35 Semigroups in automata theory, linguistics, etc.
20F10 Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] D. Brand, J. Darringer, J. Joyner ”Completeness of Conditional Reductions”; Proc. of the Workshop on Automated Deduction, 1979
[2] T.C. Brown ”On the Finiteness of Semigroups in which xr=x”; Proc. Cambridge Phil. Soc. 60, 1964 · Zbl 0134.02303
[3] A.H. Clifford, G.B. Preston ”The Algebraic Theory of Semigroups”; American Math. Society, 1961 · Zbl 0111.03403
[4] J.H. Green, D. Rees ”On Semigroups in which xr=x”, Proc. Cambridge Phil. Soc. 48, 1952 · Zbl 0046.01903
[5] J.V. Guttag, E. Horowith, D.R. Musser ”Abstract Data Types and Software Validation”; Com. of the ACM, vol. 21, no. 12, 1978 · Zbl 0387.68012
[6] J.A. Gerhardt ”The Lattice of Equational Classes of Idempotent Semigroups”; J. of Algebra, 15, 1970
[7] G. Huet, D. Oppen ”Equations and Rewrite Rules: A Survey”; in: ’Formal Language Theory: Perspectives and Open Problems’; R.V. Book (ed), Academic Press, 1980
[8] J.M. Hullot ”A Catalogue of Canonical Term Rewriting Systems”; Technical Report CSL-113, Stanford Research Institute, 1980 · Zbl 0441.68108
[9] J.M. Howie ”An Introduction to Semigroup Theory”, Academic Press, 1976 · Zbl 0355.20056
[10] M.A. Harrison ”Introduction to Formal Language Theory”, Addison Wesley, 1978 · Zbl 0411.68058
[11] G. Huet ”Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems”; JACM, vol 27, no. 4, 1980 · Zbl 0458.68007
[12] D. Knuth, P. Bendix ”Simple Word Problems in Universal Algebras”, in: Computational Problems in Abstract Algebra, (ed) J. Leech, Pergamon Press, 1970 · Zbl 0188.04902
[13] D.S. Lankford, A.M. Ballantyne ”Decision Procedure for Simple Equational Theories with Permutative Axioms”, University of Texas, Report ATP-37 · Zbl 0449.20059
[14] D. Loveland ”Automated Theorem Proving”, North Holland Publ. Comp., 1978 · Zbl 0364.68082
[15] D. McLean ”Idempotent Semigroups”, Americ. Math. Mon. 61, 1954 · Zbl 0055.01404
[16] P. Raulefs, J. Siekmann, P. Szabó, E. Univericht ”A Short Survey on the State of the Art in Matching and Unification Problems”, Bulletin of EATC, Oct. 1978
[17] J. Siekmann, P. Szabó ”Unification in Idempotent Semigroups”; Universität Karlsruhe, Institut für Informatik I (in preparation)
[18] J. Siekmann ”Unification and Matching Problems”, Universität Karlsruhe, Institut für Informatik I, 1978
[19] J. Siekmann, P. Szabó ”Universal Unification”, Universität Karlsruhe, Institut für Informatik I, 1981
[20] P. Szabó ”Unifikations theorie erster Ordnung”, Universität Karlsruhe, Ph.D. (in German)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.