Theorem proving in cancellative abelian monoids (extended abstract)

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

Volumn 1104, Issue , 1996, Pages 388-402

  Ganzinger, Harald ^a   Waldmann, Uwe ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATION; CALCULATIONS; GROUP THEORY;

ABELIAN GROUP; EXTENDED ABSTRACTS; NATURAL NUMBER; ORDERING CONSTRAINTS; SEARCH SPACES; SUPERPOSITION CALCULUS; THEOREM PROVERS; VARIABLE ELIMINATION;

THEOREM PROVING;

EID: 79955723230     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61511-3_102     Document Type: Conference Paper

References (30)

1. Jürgen Avenhaus and Klaus Becker. Conditional rewriting modulo a built-in algebra. SEKI Report SR-92-11, Fachbereich Informatik, Univ. Kaiserslautern, 1992.
2. Leo Bachmair and Harald Ganzinger. Associative-commutative superposition. In Nachum Dershowitz and Naomi Lindenstrauss, eds., Conditional and Typed Rewrite Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 1994, LNCS 968, pp. 1-14. Springer-Verlag.
3. Leo Bachmair and Harald Ganzinger. Ordered chaining for total orderings. In Alan Bundy, ed., Twelfth International Conference on Automated Deduction, Nancy, Prance, June/July 1994, LNAI 814, pp. 435-450. Springer-Verlag.
4. Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217-247, 1994.
5. Leo Bachmair, Haxald Ganzinger, and Uwe Waldmann. Superposition with simplification as a decision procedure for the monadic class with equality. In Georg Gottlob, Alexander Leitsch, and Daniele Mundici, eds., Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, Brno, Czech Republic, August 1993, LNCS 713, pp. 83-96. Springer-Verlag.
6. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Refutational theorem proving for hierarchic first-order theories. Applicable Algebra in Engineering, Communication and Computing, 5(3/4):193-212, April 1994.
7. Leo Bachmair and David A. Plaisted. Termination orderings for associative-commutative rewriting systems. Journal of Symbolic Computation, 1:329-349, 1985.
8. W. W. Bledsoe, K. Kunen, and R. Shostak. Completeness results for inequality provers. Artificial Intelligence, 27:255-288, 1985.
9. Robert S. Boyer and J Strother Moore. Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic. In Jean E. Hayes, Donald Michie, and Judith Richards, eds., Machine Intelligence 11: Logic and the acquisition of knowledge, ch. 5, pp. 83-124. Oxford University Press, 1988.
10. Hans-Jürgen Bürckert. A resolution principle for clauses with constraints. In Mark E. Stickel, ed., 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 1990, LNAI 449, pp. 178-192. Springer-Verlag.
11. Hans-Jürgen Bürckert. A Resolution Principle for a Logic with Restricted Quantifiers. LNAI 568. Springer-Verlag, Berlin, Heidelberg, New York, 1991.
12. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, ed., Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, ch. 6, pp. 243-320. Elsevier Science Publishers B.V., 1990.
13. Harald Ganzinger and Robert Nieuwenhuis. The Saturate system. URL: http://www.mpi-sb.mpg.de/SATURATE/Saturate.html, 1994.
14. Harald Ganzinger and Uwe Waldmann. Theorem proving in cancellative abelian monoids. Technical Report MPI-1-96-2-001, Max-Planck-Institut für Informatik, Saarbriicken, January 1996. URL: ftp://ftp.mpi-sb.mpg.de/pub/guide/stafr/ uwe/paper/MPI-1-96-2-001.ps.gz.
15. Larry M. Hines. Completeness of a prover for dense linear logics. Journal of Automated Reasoning, 8:45-75, 1992.
16. Larry M. Hines. Str-i-ve and integers. In Alan Bundy, ed., Twelfth International Conference on Automated Deduction, Nancy, Prance, June/July 1994, LNAI 814, pp. 416-430. Springer-Verlag.
17. Jieh Hsiang, Michael Rusinowitch, and Ko Sakai. Complete inference rules for the cancellation laws (extended abstract). In John McDermott, ed., Proceedings of the Tenth International Joint Conference on Artificial Intelligence, Milan, Italy, August 1987, vol. 2, pp. 990-992. Morgan Kaufmann Publishers, Inc.
18. Jean-Pierre Jouannaud and Claude Maxché. Termination and completion modulo associativity, commutativity and identity. Theoretical Computer Science, 104(1):29-51, October 1992.
19. Claude Kirchner, Hélène Kirchner, and Michael Rusinowitch. Deduction with symbolic constraints. Revue Française d'Intelligence Artificielle, 4(3):9-52, 1990.
20. Claude Marché. Normalised narrowing and normalised completion. In Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, Prance, July 1994, pp. 394-403. IEEE Computer Society Press.
21. Robert Nieuwenhuis and Albert Rubio. Theorem proving with ordering constrained clauses. In Deepak Kapur, ed., 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 1992, LNAI 607, pp. 477-491. Springer-Verlag.
22. Robert Nieuwenhuis and Albert Rubio. AC-superposition with constraints: no AC-unifiers needed. In Alan Bundy, ed., Twelfth International Conference on Automated Deduction, Nancy, France, June/July 1994, LNAI 814, pp. 545-559. Springer-Verlag.
23. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In Deepak Kapur, ed., 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 1992, LNAI 607, pp. 748-752. Springer-Verlag.
24. Gerald E. Peterson and Mark E. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28(2):233-264, April 1981.
25. M. M. Richter. Some reordering properties for inequality proof trees. In E. Börger, G. Hasenjäger, and D. Rödding, eds., Logic and Machines: Decision Problems and Complexity, 1984, LNCS 171, pp. 183-197. Springer-Verlag.
26. Albert Rubio and Robert Nieuwenhuis. A precedence-based total AC-compatible ordering. In Claude Kirchner, ed., Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 1993, LNCS 690, pp. 374-388. Springer-Verlag.
27. Michael Rusinowitch. Demonstration Automatique: Techniques de Réécriture, ch. 7: Ensembles complete de regies d'inférence pour les axiomes de régularité, pp. 111-127. InterEditions, Paris, 1989.
28. Jürgen Stuber. Superposition theorem proving for abelian groups represented as integer modules. To appear in Proc. RTA'96, 1996.
29. Laurent Vigneron. Associative-commutative deduction with constraints. In Alan Bundy, ed., Twelfth International Conference on Automated Deduction, Nancy, France, June/July 1994, LNAI 814, pp. 530-544. Springer-Verlag.
30. Ulrich Wertz. First-order theorem proving modulo equations. Technical Report MPI-I-92-216, Max-Planck-Institut für Informatik, Saarbrücken, April 1992.