Superposition theorem proving for abelian groups represented as integer modules

Theoretical Computer Science

Volumn 208, Issue 1-2, 1998, Pages 149-177

  Stuber, Jürgen ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Abelian groups; Automated theorem proving; Ordering restrictions; Paramodulation; Superposition

Indexed keywords

EID: 0346155282     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00082-6     Document Type: Article

References (27)

1. L. Bachmair, H. Ganzinger, Associative-commutative superposition, in: Proc. 4th Internat. Workshop on Conditional and Typed Rewriting, Lecture Notes in Computer Science, vol. 968, Springer, Berlin, 1994, Jerusalem, pp. 1-14.
2. L. Bachmair, H. Ganzinger, Rewrite-based equational theorem proving with selection and simplification, J. Logic Comput. 4 (3) (1994) 217-247.
3. L. Bachmair, H. Ganzinger, Rewrite techniques for transitive relations, in: Proc. 9th Ann. IEEE Symp. on Logic in Computer Science, Paris, 1994, pp. 384-393.
4. L. Bachmair, H. Ganzinger, C. Lynch, W. Snyder, Basic paramodulation, Infor. Comput. 121 (2) (1995) 172-192.
5. L. Bachmair, H. Ganzinger, J. Stuber, Combining algebra and universal algebra in first-order theorem proving: The case of commutative rings, in: Proc. 10th Workshop on Specification of Abstract Data Types, Lecture Notes in Computer Science, vol. 906, Santa Margherita, Italy, 1995.
6. L. Bachmair, D. Plaisted, Termination orderings for associative-commutative rewriting systems, J. Symbolic Comput. 1 (1985) 329-349.
7. A. Boudet, E. Contejean, and C. Marché, AC-complete unification and its application to theorem proving, in: Proc. 7th Int. Conf. on Rewriting Techniques and Applications Lecture Notes in Computer Science vol. 1103, Springer, Berlin, 1996, New Brunswick, NJ, USA, pp. 18-32.
8. R.S. Boyer, J.S. Moore, Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic, in: J.E. Hayes, D. Michie, J. Richards, (Eds), Machine Intelligence 11, Clarendon Press, Oxford, 1988, pp. 83-124.
9. B. Buchberger, R. Loos, Algebraic simplification, in: Computer Algebra: Symbolic and Algebraic Computation, 2nd ed., Springer, Berlin, 1983, pp. 11-43.
10. R. Bündgen, Buchberger's algorithm: the term rewriter's point of view, Theor. Comput. Sci. 159 (1996) 143-190.
11. N. Dershowitz, J. Jouannaud, Rewrite systems, in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science: Formal Models and Semantics, vol. B, ch. 6, Elsevier/MIT Press, Amsterdam, Cambridge, 1990, pp. 243-320.
12. N. Dershowitz, Z. Manna, Proving termination with multiset orderings, Commun. of the ACM 22 (8) (1979) 465-476.
13. M. Fitting, First-Order Logic and Automated Theorem Proving, Springer, Berlin, 1990.
14. H. Ganzinger, U. Waldmann, Theorem proving in cancellative abelian monoids (extended abstract), in: 13th Internat. Conf. on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 1104, New Brunswick, NJ, USA, Springer, Berlin, 1996, pp. 388-402. Full version: Technical Report MPI-I-96-2- 001, Max-Planck-Institut für Informatik, Saarbrücken, Germany, January 1996.
15. H. Ganzinger, U. Waldmann, Theorem proving in cancellative abelian monoids (extended abstract), in: 13th Internat. Conf. on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 1104, New Brunswick, NJ, USA, Springer, Berlin, 1996, pp. 388-402. Full version: Technical Report MPI-I-96-2-001, Max-Planck-Institut für Informatik, Saarbrücken, Germany, January 1996.
16. J. Jouannaud, H. Kirchner, Completion of a set of rules modulo a set of equations, SIAM J. on Comput. 15 (4) (1986) 1155-1194.
17. A. Kandri-Rody, D. Kapur, Computing a Gröbner basis of a polynomial ideal over a Euclidean domain, J. Symbolic Comput. 6 (1998) 19-36.
18. C. Kirchner, H. Kirchner, M. Rusinowitch, Deduction with symbolic constraints, Revue Française d'Intelligence Artificielle 4 (3) (1990) 9-52.
19. P. Le Chenadec, Canonical forms in finitely presented algebras, in: Proc. 7th Int. Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 170, Napa, CA, 1984, Springer, Berlin, Book version published by Pitman, London, 1986, pp. 142-165.
20. C. Marché, Normalised rewriting: an alternative to rewriting modulo a set of equations, J. Symbolic Comput. 21 (1996) 253-288.
21. R. Nieuwenhuis, A. Rubio, Theorem proving with ordering constrained clauses, in: 11th International Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 607, Saratoga Springs, NY, 1992, Springer, Berlin, pp. 477-491.
22. R. Nieuwenhuis, A. Rubio, AC-superposition with constraints: no AC-unifiers needed, in: Proc. 12th Int. Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 814, Nancy, France, 1994, Springer, Berlin, pp. 545-559.
23. G. E. Peterson, M. E. Stickel, Complete sets of reductions for some equational theories, J. ACM, 28 (2) (1981) 233-264.
24. A. Rubio, R. Nieuwenhuis, A precedence-based total AC-compatible ordering, in: Proc. 5th Int. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 690, Springer, Berlin, 1993, pp. 374-388.
25. L. Vigneron, Associative-commutative deduction with constraints, in: Proc. 12th Int. Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 814, Nancy, France, 1994, Springer, Berlin, pp. 530-544,
26. T. Wang, Elements of Z-module reasoning, in: Proc. 9th Int. Conf. on Automated Deduction, Lecture Notes in Computer Science, vol. 310, Argonne, 1988, Springer, Berlin, pp. 21-40.
27. U. Wertz, First-order theorem proving modulo equations, Tech. Report MPI-I-92-216, Max-Planck-Institut für Informatik, Saarbrücken, April 1992.