Journal of Automated Reasoning

, Volume 17, Issue 2, pp 199–214

On the completeness of SLDENF-resolution

  • Michael Thielscher

DOI: 10.1007/BF00244496

Cite this article as:
Thielscher, M. J Autom Reasoning (1996) 17: 199. doi:10.1007/BF00244496


SLDENF-resolution combines the negation-as-failure principle for logic programs involving negation, and SLDE-resolution for logic programs with an underlying equational theory. Recently, J. Shepherdson proved the soundness of this resolution principle wrt. an extended completion semantics. In this note, we investigate the particular problems of obtaining completeness which are caused by adding equational theories. As a concrete result we show to what extent the classical result for hierarchical and allowed nonequational programs can be generalized.

Key words

logic programmingnegation as failureunification theory

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Michael Thielscher
    • 1
  1. 1.TH DarmstadtFG IntellektikDarmstadtGermany