1.

Apt, K. R., Blair, H. A., and Walker, A.: Towards a theory of declarative knowledge, in J. Minker (ed.), *Foundations of Deductive Databases an Logic Programming*, Chapter 2, Morgan Kaufmann Publishers Inc., 1987, pp. 89–148.

2.

Apt, K. R. and Bol, R.: Logic programming and negation: a survey,

*J. Logic Programming*
**19/20** (1994), 9–71.

Google Scholar3.

Baader, F. and Siekmann, J. H.: Unification theory, in D. M. Gabbay, C. J. Hogger, and J. A. Robinson (eds), *Handbook of Logic in Artificial Intelligence and Logic Programming*, Oxford University Press, 1993.

4.

Clark, K. L.: Negation as failure, in H.Gallaire and J.Minker (eds),

*Logic and Data Bases*, Plenum, New York, 1978, pp. 293–322.

Google Scholar5.

Gallier, J. H. and Raatz, S.: Extending SLD-resolution to equational horn clauses using

*E*-unification,

*J. Logic Programming*
**6** (1989), 3–44.

Google Scholar6.

Hölldobler, S.: *Foundations of Equational Logic Programming*, LNAI 353, Springer, 1989.

7.

Hölldobler, S. and Thielscher, M.: Computing change and specificity with equational logic programs,

*Ann. Mathematics and Artificial Intelligence*
**14**(1) (1995), 99–133.

Google Scholar8.

Jaffar, J., Lassez, J.-L., and Lloyd, J.: Completeness of the negation as failure rule, in A. Bundy (ed.), *Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI)*, Karlsruhe, Germany, 1983, pp. 500–506.

9.

Jaffar, J., Lassez, J.-L., and Maher, M. J.: A theory of complete logic programs with equality,

*J. Logic Programming*
**1**(3) (1984), 211–223.

Google Scholar10.

Jaffar, J. and Maher, M. J.: Constraint logic programming: a survey,

*J. Logic Programming*
**19/20** (1994), 503–581.

Google Scholar11.

Kunen, K.: Signed data dependencies in logic programs,

*J. Logic Programming*
**7** (1989), 231–246.

Google Scholar12.

Lloyd, J. W.: *Foundations of Logic Programming*, Series Symbolic Computation, 2nd extended edition, Springer, 1987.

13.

Plotkin, G.: Building in equational theories,

*Machine Intelligence*
**7** (1972), 73–90.

Google Scholar14.

Robinson, J. A.: A review of automatic theorem proving, in *Annual Symposium in Applied Mathematics*, American Mathematical Society, 1967, pp. 1–18.

15.

Sato, T.: Completed logic programs and their consistency,

*J. Logic Programming*
**9** (1990), 33–44.

Google Scholar16.

Shepherdson, J. C.: Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption,

*J. Logic Programming*
**1** (1984), 51–79.

Google Scholar17.

Shepherdson, J. C.: Negation as failure II,

*J. Logic Programming*
**3** (1985), 185–202.

Google Scholar18.

Shepherdson, J. C.: Negation in logic programming for general logic programs, in J. Minker (ed.), *Foundations of Deductive Databases and Logic Programming*, Chapter 1, Morgan Kaufmann Publishers Inc., 1987, pp. 19–88.

19.

Shepherdson, J. C.: Correct answers to allowed programs and queries are ground,

*J. Logic Programming*
**11** (1991), 359–362.

Google Scholar20.

Shepherdson, J. C.: SLDNF-resolution with equality,

*J. Automated Reasoning*
**8** (1992), 297–306.

Google Scholar21.

Siekmann, J. H.: Unification of commutative terms, in *Proc. Int. Symp. on Symbolic and Algebraic Manipulation (EUROSAM)*, Marseille, France, June 1979, Springer LNCS 72, pp. 531–545.

22.

Siekmann, J. H.: Unification theory,

*J. Symbolic Computation*
**7** (1989), 207–274. Special Issue on Unification.

Google Scholar23.

Stroetmann, K.: A completeness result for SLDNF-resolution,

*J. Logic Programming*
**15** (1993), 337–355.

Google Scholar