论文信息 - On Ground AC-Completion

On Ground AC-Completion

We prove that a canonical set of rules for an equational theory defined by a finite set of ground axioms plus the associativity and commutativity of any number of operators must be finite.

Claude Marché | C. Marché

[1] Hélène Kirchner,et al. Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..

[2] Mark E. Stickel,et al. Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[3] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4] Nachum Dershowitz,et al. Orderings for Equational Proofs , 1986, LICS.

[5] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[6] Emil L. Post. Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.

[7] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .