Cancellative superposition decides the theory of divisible torsion-free abelian groups

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

Volumn 1705 LNAI, Issue , 1999, Pages 131-147

  Waldmann, Uwe ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; DECISION THEORY; TORSIONAL STRESS;

ABELIAN GROUP; DECISION PROCEDURE; FUNCTION SYMBOLS; SUPERPOSITION CALCULUS; VARIABLE ELIMINATION;

GROUP THEORY;

EID: 84886242530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_9     Document Type: Conference Paper

References (21)

1. Leo Bachmair and Harald Ganzinger. Associative-commutative superposition. In Nachum Dershowitz eind Naomi Lindenstrauss, eds., Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, LNCS 968, pp. 1-14. Springer-Verlag.
2. Leo Bachmair and Harald Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217-247, 1994.
3. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Superposition with simplification as a decision procedure for the monadic class with equality. In Georg Gottlob, Alexctnder Leitsch, and Deniele Mundici, eds., Computationai Logic and Proof Theory, Third Kurt Gödel Colloquium, Brno, Czech Republic, August 24-27, 1993, LNCS 713, pp. 83-96. Springer-Verlag.
4. 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.
5. E[dward] Cardoza, R[ichard] Lipton, and A[lbert] R. Meyer. Exponential space complete problems for petri nets and commutative semigroups: Preliminary report. In Eighth Annual ACM Symposium on Theory of Computing, Hershey, PA, USA, ' May 3-5, 1976, pp. 50-54.
6. C[hristian] Fermxiller, Apexander] Leitsch, Tanel Tammet, and Nail Zamov. Resolution Methods for the Decision Problem. LNAI 679. Springer-Verlag, Berlin, Heidelberg, New York, 1993.
7. Christian Fermiiller and Gemot Salzer. Ordered paramodulation and resolution as decision procedure. In Andrei Voronkov, ed., Logic Programming and Automated Reasoning, 4th International Conference, LPAR'93, St. Petersburg, Russia, July 13-20, 1993, LNCS 698, pp. 122-133. Springer-Verlag.
8. Harald Ganzinger and Hans de Nivelle. A superposition decision procedure for the guarded fragment with equality. In Fourteenth Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pp. 295-303. IEEE Computer Society Press.
9. Harald Ganzinger, Ullrich Hustadt, Christoph Meyer, and Renate Schmidt. A resolution-based decision procedure for extensions of K4. In Advances in Modal Logic '98, 1998. To appear.
10. Harald Ganzinger and Uwe Waldmann. Theorem proving in cancellative abehfin monoids (extended abstract). In Michael A. McRobbie etnd John K. Slaney, eds. Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30-August 3, 1996, LNAI 1104, pp. 388-402. Springer-Verlag.
11. William H. Joyner Jr. Resolution strategies as decision procedures. Journal of the ACM, 23(3):398-417, July 1976.
12. Ernst W. Mayr and Albert R. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics, 46(3):305-329, December 1982.
13. Etienne Paul. A general refutational completeness result for an inference procedure based on associative-commutative unification. Journal of Symbolic Computation, 14(6):577-618, December 1992.
14. 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.
15. Gordon D. Plotkin. Building-in equational theories. In Bernard Meltzer and Donald Michie, eds., Machine Intelligence 7, ch. 4, pp. 73-90. American Elsevier, New York, NY, USA, 1972.
16. Michaël Rusinowitch and Laurent Vigneron. Automated deduction with associative-commutative operators. Applicable Algebra in Engineering, Communication and Computing, 6(l):23-56, January 1995.
17. James R. Slagle. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal of the ACM, 21(4):622-642, October 1974.
18. Uwe Waldmann. Canceliative Abelian Monoids in Refutational Theorem Proving. Dissertation, Universität des Saarlaudes, Saarbrücken, Germany, 1997. http://www.mpi-sb.mpg.de/~uwe/paper/PhD.ps.gz.
19. Uwe Waldmamn. Extending reduction orderings to ACU-compatible reduction orderings. Information Processing Letters, 67(l):43-49, July 16, 1998.
20. Uwe Waldmann. Superposition for divisible torsion-free abelian groups. In Claude Kirchner and Helene Kirchner, eds., Automated Deduction - CADE-15,15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, LNAI 1421, pp. 144-159. Springer-Verlag.
21. Ulrich Wertz. First-order theorem proving modulo equations. Technical Report MPI-I-92-216, Max-Planck-Institut fiir Informatik, Saarbriicken, Germany, April 1992.