Theorem-proving with resolution and superposition

Journal of Symbolic Computation

Volumn 11, Issue 1-2, 1991, Pages 21-49

  Rusinowitch, Michael ^a  

^a CRIN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947911578     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(08)80131-9     Document Type: Article

References (26)

1. Completion without failure
2. A Structured Design Method for Specialized Proof Procedures
3. Orderings for term rewriting systems
4. Termination
5. Termination
6. A superposition oriented theorem prover
7. Unit refutation and horn sets
8. A new method for establishing refutational completeness in theorem proving
9. Proving refutational completeness of theorem proving strategies. The transfinite semantic tree method
10. On word problems in equational theories
11. A complete proof of correctness of Knuth-Bendix completion algorithm
12. On word problems in Horn theories
13. On word problems in Horn theories
14. Simple words problems in universal algebras
15. A confluence criterion based on the generalised Newman lemma
16. Canonical inference
17. A portable environment for research in automated reasoning
18. On solving the equality problem in theories defined by Horn clauses
19. A technique for establishing completeness results in theorem proving with equality
20. Building-in equational theories
21. A machine-oriented logic based on the resolution principle
22. Démonstration automatique par des techniques de réécriture
23. Paramodulation and theorem proving in first-order theories with equality
24. The concept of demodulation in theorem proving