Elimination of equality via transformation with ordering constraints

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

Volumn 1421, Issue , 1998, Pages 175-190

  Bachmair, Leo ^a   Ganzinger, Harald ^b   Voronkov, Andrei ^c  

^a STONY BROOK UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; BIOMINERALIZATION;

AUXILIARY VARIABLES; EQUATIONAL THEOREM PROVING; ORDERING CONSTRAINTS; PARAMODULATION; PROOF SEARCH; PROTOTYPE IMPLEMENTATIONS; TRANSFORMATION PROCESS;

THEOREM PROVING;

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

References (10)

1. 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
2. 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-1-97-2-012
3. Baumgartner, P. & Furbach, U. (1994), PROTEIN: A PROveτ with a Theory Extension /Merface, in A. Bundy, ed., 'Automated Deduction-CADE-12. 12th International Conference on Automated Deduction.," Vol. 814 of Lecture Notes in Artificial Intelligence, Nancy, France, pp. 769-773.
4. Brand, D. (1975), 'Proving theorems with the modification method', SIAM Journal of Computing 4, 412-430.
5. Degtyarev, A. & Voronkov, A. (1996a), Equality elimination for the tableau method, in J. Calmet & C. Limongelli, eds, 'Design and Implementation of Symbolic Computation Systems. International Symposium, DISCO'96', Vol. 1128 of Lecture Notes in Computer Science, Karlsruhe, Germany, pp. 46-60.
6. Degtyarev, A. & Voronkov, A. (1996b), What you always wanted to know about rigid. E-unification, in J. Alferes, L. Pereira & E. Orlowska, eds, 'Logics in Artificial Intelligence. European Workshop, JELIA'96', Vol. 1126 of Lecture Notes in Artificial Intelligence, Evora, Portugal, pp. 50-69.
7. Ibens, O. & Letz, R. (1997), Subgoal alternation in model elimination, in D. Galmiche, ed., 'Automated Reasoning with Analytic Tableaux and Related Methods', Vol. 1227 of Lecture Notes in Artificial Intelligence, Springer Verlag, pp. 201-215.
8. Moser, M., Lynch, C. & Steinbach, J. (1995), Model elimination with basic ordered paramodulation, Technical Report AR-95-11, Fakultät für Informatik, Technische Universität München, München.
9. Moser, M. & Steinbach, J. (1997), STE-modification revisited, Technical Report AR-97-03, Fakultät fur Informatik, Technische Universität München, München.
10. Schumann, J. (1994), 'Tableau-based theorem provers: Systems and implementations', Journal of Automated Reasoning 13(3), 409-421.