Strict basic superposition

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

Volumn 1421, Issue , 1998, Pages 160-174

  Bachmair, Leo ^a   Ganzinger, Harald ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; BIOMINERALIZATION; SEMANTICS; THEOREM PROVING;

CANDIDATE MODELS; ELIMINATION METHOD; PARAMODULATION;

CALCULATIONS;

EID: 48949112492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054258     Document Type: Conference Paper

References (12)

1. Bachmair, L. & Ganzinger, H. (1990), On restrictions of ordered paramodulation with simplification, in M. Stickel, ed., 'Proc. 10th Int. Conf. on Automated Deduction, Kaiserslautern', Vol. 449 of Lecture Notes in Computer Science., Springer-Verlag, Berlin, pp. 427-441.
2. Bachmair, L. & Ganzinger, H. (1994), 'Rewrite-based equational theorem proving with selection and simplification', J. Logic and Computation 4(3), 217-247. Revised version of Technical Report MPI-I-91-208, 1991.
3. Bachmair, L. & Ganzinger, H. (1995), Ordered chaining calculi for first-order theories of binary relations, Research Report MPI-I-95-2-009, Max-Planck-Institut für Informatik, Saarbrücken, Saarbrücken. Revised version to appear in JACM. URL: www. mpi-sb. mpg. de/~hg/pra. html#MPI-I-95-2-009
4. Bachmair, L. &: Ganzinger, H. (1997), Strict basic superposition and chaining, Research Report MPI-I-97-2-011, Max-Planck-Institut für Informatik, Saarbrücken, Saarbrücken. URL: www. mpi-sb. mpg. de/~hg/pra. html#MPI-I-97-2-011
5. Bachmair, L., Ganzinger, H., Lynch, C. & Snyder, W. (1992), Basic paramodulation and superposition, in D. Kapur, ed., 'Automated Deduction-CADE'lI, Vol. 607 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 462-476.
6. Bachmair, L., Ganzinger, H. & Voronkov, A. (1997), Elimination of equality via transformation with ordering constraints, Research Report MPI-I-97-2-012, Max-Planck-Institut für Informatik, Saarbrücken, Saarbrücken. URL: www. mpi-sb. mpg. de/~hg/pra. html#MPI-I-97-2-012
7. Brand, D. (1975), 'Proving theorems with the modification method', SIAM J. Comput. 4, 412-430.
8. Nieuwenhuis, R. & Rubio, A. (1992a), Basic superposition is complete, in 'ESOP'92', Vol. 582 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 371-389.
9. Nieuwenhuis, R. & Rubio, A. (1992b), Theorem proving with ordering constrained clauses, in 'Automated Deduction-CADE'lI, Vol. 607 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 477-491.
10. Pais, J. & Peterson, G. (1991), 'Using forcing to prove completeness of resolution and paramodulation', J. Symbolic Computation 11, 3-19.
11. Zhang, H. (1988), Reduction, superposition and induction: Automated reasoning in an equational logic, PhD thesis, Rensselaer Polytechnic Institute, Schenectady, New York.
12. Zhang, H. & Kapur, D. (1988), First-order theorem proving using conditional rewrite rules, in E. Lusk & R. Overbeek, eds, 'Proc. 9th Int. Conf. on Automated Deduction', Vol. 310 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 1-20.