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.
Apt, K. R. and Bol, R.: Logic programming and negation: a survey, J. Logic Programming
(1994), 9–71.Google Scholar
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.
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 Scholar
Gallier, J. H. and Raatz, S.: Extending SLD-resolution to equational horn clauses using E
-unification, J. Logic Programming
(1989), 3–44.Google Scholar
Hölldobler, S.: Foundations of Equational Logic Programming, LNAI 353, Springer, 1989.
Hölldobler, S. and Thielscher, M.: Computing change and specificity with equational logic programs, Ann. Mathematics and Artificial Intelligence
(1) (1995), 99–133.Google Scholar
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.
Jaffar, J., Lassez, J.-L., and Maher, M. J.: A theory of complete logic programs with equality, J. Logic Programming
(3) (1984), 211–223.Google Scholar
Jaffar, J. and Maher, M. J.: Constraint logic programming: a survey, J. Logic Programming
(1994), 503–581.Google Scholar
Kunen, K.: Signed data dependencies in logic programs, J. Logic Programming
(1989), 231–246.Google Scholar
Lloyd, J. W.: Foundations of Logic Programming, Series Symbolic Computation, 2nd extended edition, Springer, 1987.
Plotkin, G.: Building in equational theories, Machine Intelligence
(1972), 73–90.Google Scholar
Robinson, J. A.: A review of automatic theorem proving, in Annual Symposium in Applied Mathematics, American Mathematical Society, 1967, pp. 1–18.
Sato, T.: Completed logic programs and their consistency, J. Logic Programming
(1990), 33–44.Google Scholar
Shepherdson, J. C.: Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption, J. Logic Programming
(1984), 51–79.Google Scholar
Shepherdson, J. C.: Negation as failure II, J. Logic Programming
(1985), 185–202.Google Scholar
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.
Shepherdson, J. C.: Correct answers to allowed programs and queries are ground, J. Logic Programming
(1991), 359–362.Google Scholar
Shepherdson, J. C.: SLDNF-resolution with equality, J. Automated Reasoning
(1992), 297–306.Google Scholar
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.
Siekmann, J. H.: Unification theory, J. Symbolic Computation
(1989), 207–274. Special Issue on Unification.Google Scholar
Stroetmann, K.: A completeness result for SLDNF-resolution, J. Logic Programming
(1993), 337–355.Google Scholar