On restrictions of ordered paramodulation with simplification

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

Volumn 449 LNAI, Issue , 1990, Pages 427-441

  Bachmair, Leo ^a   Ganzinger, Harald ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; LOGIC PROGRAMMING; SEMANTICS; THEOREM PROVING;

ELIMINATION TECHNIQUES; FIRST ORDER; HORN CLAUSE; PARAMODULATION; REWRITE SYSTEMS; SUPERPOSITION CALCULUS;

CALCULATIONS;

EID: 85027601746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52885-7_105     Document Type: Conference Paper

References (14)

1. BACHMAIR, L., DERSHOWITZ, N., PLAISTED, D. 1989. Completion without failure. In Resolution of Equations in Algebraic Structures, vol. 2, ed. H. Ait-Kaci and M. Nivat, 1–30. Academic Press.
2. BACHMAIR, L., and GANZINGER, H. 1990. Completion of first-order clauses with equality by strict superposition. In Proc. Second Int. Workshop on Conditional and Typed Rewriting Systems. Lect. Notes in Comput. Sci. Berlin, Springer-Verlag. To appear.
3. GANZINGER, H. 1987. A completion procedure for conditional equations. In Conditional Term Rewriting Systems, ed. S. Kaplan and J.-P. Jouannaud, 62–83. Lect. Notes in Comput. Sci., vol. 308. Berlin, Springer-Verlag. To appear in J. Symbolic Computation.
4. HSIANG, J., RUSINOWITCH, M. 1987. On word problems in equational theories. In Proc. 14th ICALP, ed. T. Ottmann, 54–71. Lect. Notes in Comput. Sci., vol. 267. Berlin, Springer-Verlag.
5. HSIANG, J., RUSINOWITCH, M. 1989. Proving refutational completenes of theorem proving strategies: The transfinite semantic tree method. Submitted for publication.
6. HUET, G. 1980. Confluent reductions: Abstract properties and applications to term rewriting systems. J. ACM 27:797–821.
7. KNUTH, D., BENDIX, P. 1970. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, ed. J. Leech, 263–297. Oxford, Pergamon Press.
8. KOUNALIS, E., RUSINOWITCH, M. 1988. On word problems in Horn theories. In Proc. 9th Int. Conf. on Automated Deduction, ed. E. Lusk and R. Overbeek, 527–537. Lect. Notes in Comput. Sci., vol. 310. Berlin, Springer-Verlag.
9. LANKFORD, D. 1975. Canonical inference. Tech. Rep. ATP-32, Dept. of Mathematics and Computer Science, University of Texas, Austin.
10. ROBINSON, G., WOS, L. T. 1969. Paramodulation and theorem proving in first order theories with equality. In Machine Intelligence 4, ed. B. Meltzer and D. Michie, 133–150. New York, American Elsevier.
11. RUSINOWITCH, M. 1988. Theorem proving with resolution and superposition: An extension of the Knuth and Bendix procedure as a complete set of inference rules. Submitted for publication.
12. WOS, L. T., ROBINSON, G. A., CARSON, D. F., SHALLA, L. 1967. The concept of demodulation in theorem proving. J. ACM 14:698–709.
13. ZHANG, H. 1988. Reduction, superposition and induction: Automated reasoning in an equational logic. Ph.D. diss., Rensselaer Polytechnic Institute, Schenectady, New York.
14. ZHANG, H., KAPUR, D. 1988. First-order theorem proving using conditional rewrite rules. In Proc. 9th Int. Conf. on Automated Deduction, ed. E. Lusk and R. Overbeek, 1–20. Lect. Notes in Comput. Sci., vol. 310. Berlin, Springer-Verlag.