, Volume 17, Issue 2, pp 199-214

On the completeness of SLDENF-resolution

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.