Paramodulation-Based Theorem Proving

This publication has 48 references indexed in Scilit:

• Basic Paramodulation
  Information and Computation, 1995
• Rewrite-based Equational Theorem Proving with Selection and Simplification
  Journal of Logic and Computation, 1994
• Syntacticness, Cycle-Syntacticness, and Shallow Theories
  Information and Computation, 1994
• Equational inference, canonical proofs, and proof orderings
  Journal of the ACM, 1994
• SOLVING SYMBOLIC ORDERING CONSTRAINTS
  International Journal of Foundations of Computer Science, 1990
• Completion for rewriting modulo a congruence
  Theoretical Computer Science, 1989
• Narrowing vs. SLD-resolution
  Theoretical Computer Science, 1988
• Termination of rewriting systems by polynomial interpretations and its implementation
  Science of Computer Programming, 1987
• Termination orderings for associative-commutative rewriting systems
  Journal of Symbolic Computation, 1985
• Proving Theorems with the Modification Method
  SIAM Journal on Computing, 1975