Oriented equational logic programming is complete

Journal of Symbolic Computation

Volumn 23, Issue 1, 1997, Pages 23-45

  Lynch, Christopher ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030640054     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0075     Document Type: Article

References (27)

1. Bachmair, L. (1991). Canonical Equational Proofs. Boston, MA: Birkhauser Boston, Inc.
2. Bachmair, L., Dershowitz, N., Plaisted, D. (1989). Completion without failure. Resolution of Equations in Algebraic Structures 2, pp. 1-30.
3. Bachmair, L., Ganzinger, H. (1990). On restrictions of ordered paramodulation with simplification. In Proc. 10th Int. Conf. on Automated Deduction, LNCS, vol. 449, pp. 427-441, Berlin: Springer-Verlag.
4. Bachmair, L., Ganzinger, H. (1994). Rewrite-based equational theorem proving with selection and simplification. J. Logic and Computation 4(3):217-247.
5. Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W. (1992). Basic paramodulation. In Proc. 11th Int. Conf. on Automated Deduction, Lect. Notes in Artificial Intelligence 607, pp. 462-476, Berlin: Springer-Verlag.
6. Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W. (1995). Basic paramodulation. Information and Computation 121(2):172-192.
7. Brand, D. (1975). Proving theorems with the modification method. SIAM J. Computing 4(4):412-430.
8. Dershowitz, N. (1991). A Maximal Literal Unit Strategy for Horn Clauses. Proc. 2nd Int. Workshop on Conditional Term Rewriting Systems, LNCS, vol. 516, pp. 14-25.
9. Dershowitz, N., Jouannaud, J.-P. (1990). Rewrite Systems. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science B: Formal Methods and Semantics, pp. 243-320. Amsterdam: North-Holland.
10. Fribourg, L. (1984). Oriented equational clauses as a programming language. J. Logic Programming 1(2):165-177.
11. Giovanetti, E., Moiso, C. (1986). A Completeness Result for E-Unification Algorithms based on Conditional Narrowing. In Proc. of the Workshop on Foundations of Logic and Functional Programming, LNCS, vol. 306, pp. 157-167
12. Hullot, J.-M. (1980). Canonical forms and unification. In Proc. 5th Int. Conf. on Automated Deduction, LNCS, vol. 87, pp. 318-334, Berlin: Springer-Verlag.
13. Hsiang, J., Rusinowitch, M. (1991). Proving refutational completeness of theorem proving strategies: The transfinite semantic tree method. J. Association for Computing Machinery 38 pp. 559-587.
14. Kaplan, S. (1984). Conditional rewrite rules. Theoretical Computer Science 33(2):175-193.
15. Kirchner, C., Kirchner, H., Rusinowitch, M. (1990). Deduction with symbolic constraints. Revue Francaise d'Intelligence Artificielle 4(3):9-52.
16. Kounalis, E., Rusinowitch, M. (1988). On Word Problems in Horn Logic. Proc. 1st Int. Workshop on Conditional Term Rewriting Systems, LNCS, vol. 308, pp. 144-160.
17. Lynch, C. (1995). Paramodulation without duplication. In Proc. 10th Int. IEEE Symp. on Logic in Computer Science, San Diego.
18. Middledorp, A., Hamoen, E. (1994). Completeness Results for Basic Narrowing. Applicable Algebra in Engineering, Communication and Computing 5:213-253.
19. Nieuwenhuis, R. (1995). On Narrowing, Refutation Proofs and Constraints. In Proc. 6th Int. Conf. on Rewriting Techniques and Applications, LNCS, vol. 914, pp. 56-70. Berlin, Springer-Verlag.
20. Nieuwenhuis, R., Nivela, P. (1991). Efficient deduction in Equality Horn Logic by Horn-completion. Information Processing Letters 39 pp. 1-6.
21. Nieuwenhuis, R., Rubio, A. (1992). Basic Superposition is Complete. In Proc. European Symposium on Programming, Rennes, France.
22. Nieuwenhuis, R., Rubio, A. (1995). Theorem proving with ordering and equality constrained clauses. J. Symbolic Computation 19(4):321-352.
23. Pais, J., Peterson, G. (1991). Using forcing to prove completeness of resolution and paramodulation. J. Symbolic Computation 11:3-19.
24. Robinson, G.A., Wos, L.T. (1969). Paramodulation and theorem proving in first order theories with equality. In B. Meltzer, D. Michie, eds, Machine Intelligence 4 pp. 133-150. New York, American Elsevier.
25. Rusinowitch, M. (1988). Theorem-proving with resolution and superposition: an extension of Knuth and Bendix procedure to a complete set of inference rules. In Proc. International Conference on Fifth Generation Computer Systems.
26. Snyder, W., Lynch, C. (1991a). An Inference System for Horn Clause Logic with Equality. Proc. 2nd Int. Workshop on Conditional Term Rewriting Systems, LNCS, vol. 516, pp. 454-461.
27. Snyder, W., Lynch, C. (1991). Goal directed strategies for paramodulation. In Proc. 4th Int. Conf. on Rewriting Techniques and Applications, LNCS, vol. 488, pp. 150-161, Berlin: Springer-Verlag.