Superposition with completely built-in Abelian groups

Journal of Symbolic Computation

Volumn 37, Issue 1, 2004, Pages 1-33

  Godoy, Guillem ^a   Nieuwenhuis, Robert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348234226     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(03)00070-1     Document Type: Article

References (31)

1. Baader, F., Siekmann, J., 1993. Unification theory. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press.
2. Baader, F., Snyder, W., 2001. Unification theory. In: Robinson, J.A., Voronkov, A. (Eds.), Handbook of Automated Reasoning, vol. 1, Elsevier Science Publishers and MIT Press, pp. 445-532.
3. Bachmair, L., Ganzinger, H., 1994. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation 4 (3), 217-247.
4. Bachmair, L., Ganzinger, H., Lynch, Chr., Snyder, W., 1995. Basic paramodulation. Information and Computation 121 (2), 172-192.
5. Basin, D., Ganzinger, H., 1996. Complexity analysis based on ordered resolution. In: LICS, Eleventh Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, New Brunswick, New Jersey, USA, pp. 456-465.
6. Le Chenadec, P., 1986. Canonical forms in finitely presented algebras, Research Notes in Theoretical Computer Science. Pitman, London; Wiley, New York, Toronto.
7. Dershowitz, N., 1982. Orderings for term-rewriting systems. Theoretical Computer Science 17 (3), 279-301.
8. Dershowitz, N., Jouannaud, J-P., 1990. Rewrite systems. In: van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, vol. B, Formal Models and Semantics. Elsevier Science Publishers B.V., Amsterdam, New York, Oxford, Tokyo, pp. 244-320 (Chapter 6).
9. Ganzinger, H., de Nivelle, H., 1999. A superposition decision procedure for the guarded fragment with equality. In: LICS, 14th IEEE Symposium on Logic in Computer Science. Trento, Italy, pp. 295-305.
10. Ganzinger, H., Meyer, C., Veanes, M., 1999. The two-variable guarded fragment with transitive relations. In: LICS, 14th IEEE Symposium on Logic in Computer Science, Trento, Italy, pp. 24-34.
11. Ganzinger, H., Waldmann, U., 1996. Theorem proving in cancellative Abelian monoids. In: McRobbie, M.A., Slaney, J.K. (Eds.), CADE, Thirteenth International Conference on Automated Deduction, LNAI, vol. 1104. Springer, New Brunswick, pp. 388-402.
12. Godoy, G., Nieuwenhuis, R., 2000. Paramodulation with built-in Abelian groups. In: LICS, 15th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Santa Barbara, USA, pp. 413-424.
13. Godoy, G., Nieuwenhuis, R., 2001. Ordering constraints for deduction with built-in Abelian semigroups, monoids and groups. In: LICS, 16th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Boston, USA, pp. 38-47.
14. Lankford, D.S., Ballantyne, A.M., 1977. Decision procedures for simple equational theories with commutative-associative axioms: complete sets of commutative-associative reductions, Technical Report Memo ATP-39. Department of Mathematics and Computer Science, University of Texas, Austin, TX.
15. Marché, C., 1994. Normalised rewriting and normalised completion. In: Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France. IEEE Computer Society Press. Los Alamitos, CA, USA.
16. Marché, C., 1996. Normalized rewriting: an alternative to rewriting modulo a set of equations. Journal of Symbolic Computation 21 (3), 253-288.
17. Nieuwenhuis, R., 1996. Basic paramodulation and decidable theories. In: Eleventh Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press. New Brunswick, New Jersey, USA, pp. 473-482.
18. Nieuwenhuis, R., 1998. Decidability and complexity analysis by basic paramodulation. Information and Computation 147, 1-21.
19. Nieuwenhuis, R., Rubio, A., 1995. Theorem proving with ordering and equality constrained clauses. Journal of Symbolic Computation 19 (4), 321-351.
20. Nieuwenhuis, R., Rubio, A., 1997. Paramodulation with built-in AC-theories and symbolic constraints. Journal of Symbolic Computation 23 (1), 1-21.
21. Nieuwenhuis, R., Rubio, A., 2001. Paramodulation-based theorem proving. In: Robinson, J.A., Voronkov, A. (Eds.), Handbook of Automated Reasoning. Elsevier Science Publishers and MIT Press, pp. 371-444.
22. Peterson, G.E., Stickel, M.E., 1981. Complete sets of reductions for some equational theories. Journal of the Association for Computing Machinery 28 (2), 233-264.
23. Plotkin, G., 1972. Building in equational theories. Machine Intelligence 7, 73-90.
24. Slagle, J.R., 1974. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal of the ACM 21 (4), 622-642.
25. Stuber, J., 1998. Superposition theorem proving for Abelian groups represented as integer modules. Theoretical Computer Science 208 (1-2), 149-177.
26. Stuber, J., 1999. Superposition Theorem Proving for Commutative Algebraic Theories, Dissertation. Technische Fakultät, Universität des Saarlandes, Saarbrücken, Germany.
27. Vigneron, L., 1994. Associative Commutative Deduction with constraints. In: Bundy, A. (Ed.), CADE, 12th International Conference on Automated Deduction, LNAI, vol. 814. Springer-Verlag, Nancy, France, pp. 530-544.
28. Waldmann, U., 1997. Cancellative Abelian Monoids in Refutational Theorem Proving, Dissertation. Universität des Saarlandes, Saarbrücken, Germany.
29. Waldmann, U., 1998. Superposition for divisible torsion-free Abelian monoids. In: Kirchner, C., Kirchner, H. (Eds.), CADE-98, Proceedings of the Fifteenth International Conference on Automated Deduction, LNAI, vol. 1421. Springer, Lindau, Germany, pp. 144-159.
30. Waldmann, U., 1999. Cancellative superposition decides the theory of divisible torsion-free Abelian groups. In: Logic Programming and Automated Reasoning, Int. Conf., LNAI, vol. 1705. Springer-Verlag, Tbilisi, Georgia, pp. 131-147.
31. Zhang, H., 1993. A case study of completion modulo distributivity and Abelian groups. In: Kirchner, C. (Ed.), RTA-93, Proceedings of the 5th International Conference on Rewriting Techniques and Applications, LNCS, vol. 690. Springer-Verlag, pp. 32-46.