Extending reduction orderings to ACU-compatible reduction orderings

Information Processing Letters

Volumn 67, Issue 1, 1998, Pages 43-49

  Waldmann, Uwe ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Abelian monoids; Automatic theorem proving; Term rewriting; Termination

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA REDUCTION; SET THEORY;

ABELIAN MONOIDS; EXTENDING REDUCTION ORDERINGS; SELF LABELLING METHODS; TERM REWRITING;

THEOREM PROVING;

EID: 0032115686     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00084-2     Document Type: Article

References (13)

1. L. Bachmair, H. Ganzinger, Associative-commutative super-position, in: N. Dershowitz, N. Lindenstrauss (Eds.), Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, LNCS 968, Springer, Berlin, pp. 1-14.
2. T.B. Baird, G.E. Peterson, R.W. Wilkerson, Complete sets of reductions modulo associativity, commutativity and identity, in: N. Dershowitz (Ed.), Rewriting Techniques and Applications, 3rd International Conference, Chapel Hill, NC, USA, April 3-5, 1989, LNCS 355, Springer, Berlin, pp. 29-44.
3. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier, Amsterdam, The Netherlands, 1990, Chapter 6, pp. 243-320.
4. H. Ganzinger, U. Waldmann, Theorem proving in cancellative abelian monoids (extended abstract), in: M.A. McRobbie, J.K. Slaney (Eds.), Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30-August 3, 1996, LNAI 1104, Springer, Berlin, pp. 388-402.
5. J.-P. Jouannaud, C. Marché, Termination and completion modulo associativity, commutativity and identity, Theoretical Computer Science 104 (1) (1992) 29-51.
6. D. Kapur, P. Narendran, Double-exponential complexity of computing a complete set of AC-unifiers, in: Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, USA, June 22-25, 1992, IEEE Computer Society Press, pp. 11-21.
7. C. Marché, Normalized rewriting: an alternative to rewriting modulo a set of equations, J. Symbolic Computation 21 (3) (1996) 253-288.
8. A. Middeldorp, H. Ohsaki, H. Zantema, Transforming termination by self-labelling, in: M.A. McRobbie, J.K. Slaney (Eds.), Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30-August 3, 1996, LNAI 1104, Springer, Berlin, pp. 373-387.
9. G.E. Peterson, M.E. Stickel, Complete sets of reductions for some equational theories, J. ACM 28 (2) (1981) 233-264.
10. J. Stuber, Superposition theorem proving for abelian groups represented as integer modules, in: H. Ganzinger (Ed.), Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, LNCS 1103, Springer, Berlin, pp. 33-47.
11. U. Waldmann, Cancellative Abelian Monoids in Refutational Theorem Proving, Ph.D. Thesis, Universität des Saarlandes, Saarbrücken, Germany, 1997. http://www.mpi-sb.mpg. de/~uwe/paper/PhD.ps.gz.
12. U. Waldmann, Superposition for divisible torsion-free abelian groups, in: C. Kirchner, H. Kirchner (Eds.), CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, to appear.
13. U. Wertz, First-order theorem proving modulo equations, Technical Report MPI-I-92-216, Max-Planck-Institut für Informatik, Saarbrücken, Germany, April 1992.