Superposition theorem proving for abelian groups represented as integer modules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1103, Issue , 1996, Pages 33-47

  Stuber, Jürgen ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; THEOREM PROVING;

ABELIAN GROUP; LITERALS; REFUTATIONAL COMPLETENESS; STANDARD SUPERPOSITIONS; SUPERPOSITION CALCULUS; SUPERPOSITION THEOREM; UNIFICATION PROBLEM;

GROUP THEORY;

EID: 84957617657     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_41     Document Type: Conference Paper

References (20)

1. Bachmair, L. and Ganzingee, H. (1994a). Associative-commutative superposition. In Proc. 4th Int. Workshop on Conditional and Typed Rewriting, Jerusalem, LNCS 968, pp. 1-14. Springer.
2. Bachmair, L. and Ganzinger, H. (1994b). Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation 4(3): 217-247.
3. Bachmair, L. and Ganzinger, H. (1994c). Rewrite techniques for transitive relations. In Proc. 9th Ann. IEEE Symp. on Logic in Computer Science, Paris, pp. 384-393.
4. Bachmair, L., Ganzinger, H. and Stuber, J. (1995). Combining algebra and universal algebra in first-order theorem proving: The case of commutative rings. In Proc. 1 Oth Workshop on Specification of Abstract Data Types, Santa Margherita, Italy, LNCS 906.
5. Bachmair, L., Ganzinger, H., Lynch, C. and Snyder, W. (1993). Basic paramodulation. Technical Report MPI-I-93-236, Max-Planck-Institut fur Informatik, Saarbrücken.
6. Boudet, A., Contejean, E. and Marché, C. (1996). AC-complete unification and its application to theorem proving. This volume.
7. Boyer, R. S. and Moore, J. S. (1988). Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic. In J. E. Hayes, D. Michie and J. Richards (eds), Machine Intelligence 11, pp. 83-124. Clarendon Press, Oxford.
8. Dershowitz, N. and Jouannaud, J.-P. (1990). Rewrite systems. In J. vanLeeuwen (ed.), Handbook of Theoretical Computer Science: Formal Models and Semantics, Vol. B, chapter 6, pp. 243-320. Elsevier/MIT Press.
9. Fitting, M. (1990). First-Order Logic and Automated Theorem Proving. Springer.
10. Ganzinger, H. and Waldmann, U. (1996). Theorem proving in cancellative abelian monoids. Technical Report MPI-1-96-2-001, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
11. Jouannaud, J.-P. and Kirchner, H. (1986). Completion of a set of rules modulo a set of equations. SIAM Journal on Computing 15(4): 1155-1194.
12. Kandri-Rody, A. and Kapur, D. (1988). Computing a Gröbner basis of a polynomial ideal over a euclidean domain. Journal of Symbolic Computation 6: 19-36.
13. Kirchner, C., Kirchner, H. and Rusinowitch, M. (1990). Deduction with symbolic constraints. Revue Française d'lntelligence Artificielle 4(3): 9-52.
14. Le Chenadec, P. (1984). Canonical forms in finitely presented algebras. In Proc. 7th Int. Conf. on Automated Deduction, Napa, CA, LNCS 170, pp. 142-165. Springer. Book version published by Pitman, London, 1986.
15. Marché, C. (1994). Normalised rewriting and normalised completion. In Proc. 9th Symp. on Logic in Computer Science, Paris, pp. 394-403. IEEE Computer Society Press.
16. Nieuwenhuis, R. and Rubio, A. (1992). Theorem proving with ordering constrained clauses. In 11th International Conference on Automated Deduction, Saratoga Springs, NY, LNCS 607, pp. 477-491. Springer.
17. Nieuwenhuis, R. and Rubio, A. (1994). AC-superposition with constraints: no AC- unifiers needed. In Proc. 12th Int. Conf. on Automated Deduction, Nancy, France, LNCS 814, pp. 545-559. Springer.
18. VIGNERON, L. (1994). Associative-commutative deduction with constraints. In Proc. 12th Int. Conf. on Automated Deduction, Nancy, France, LNCS 814, pp. 530-544. Springer.
19. Wang, T. C. (1988). Elements of Z-module reasoning. In Proc. 9th Int. Conf. on Automated Deduction, Argonne, LNCS 310, pp. 21-40. Springer.
20. Wertz, U. (1992). First-order theorem proving modulo equations. Technical Report MPI- 1-92-216, Max-Planck-Institut für Informatik, Saarbrücken.