Abstract
The classic results of logic programming are based on an underlying equality relation of syntactic identity. Jaffar, Lassez and Maher [2] have shown how to extend these results, for definite clause programs, to other equality relations. We continue their development by showing how to deal with programs have negative literals in the bodies of clauses. We define an appropriate version of SLDNF-resolution and prove its soundness with respect to a notion of completed logic program.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clark, K. L., ‘Negation as failure’, in: H. Gallaire and J. Minker (Eds.), Logic and Databases, Plenum Press, New York, pp. 293–322 (1978).
Jaffar, J., Lassez, J.-L. and Maher, M. J., ‘A theory of complete logic programs with equality’, J. Logic Programming 1(3), 211–223 (1984).
Jaffar, J., Lassez, J.-L., and Maher, M. J., ‘Comments on “General failure of logic programs”,’ J. Logic Programming 3(2), 115–118 (1986).
LeVan Tu, ‘General failure of logic programs’, J. Logic Programming 2(2), 157–165 (1985).
LeVan Tu, ‘Negation as failure for general logic programs with equality’, J. Logic Programming 2(4), 285–294 (1985).
Lloyd, J. W., Foundations of Logic Programming, 2nd edition, Springer-Verlag, Berlin (1987).
Wolfram, D. A., Maher, M. J., and Lassez, J.-L., ‘A unified treatment of resolution strategies for logic programs’, Proc. Second International Conference on Logic Programming, Uppsala (1984).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shepherdson, J.C. SLDNF-resolution with equality. J Autom Reasoning 8, 297–306 (1992). https://doi.org/10.1007/BF00244285
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00244285