Completeness of SLDNF-Resolution for Non-Floundering Queries

@inproceedings{Drabent1993CompletenessOS,
  title={Completeness of SLDNF-Resolution for Non-Floundering Queries},
  author={Wlodzimierz Drabent},
  booktitle={ILPS},
  year={1993}
}
W LODZIMIERZ DRABENT. SLDNF-resolution is a standard operational semantics for negation as ((nite) failure. For some programs and goals SLDNF-resolution is incomplete with respect to the Kunen semantics (program completion in 3-valued logic). Intuitively, the reason of incompleteness is oundering. This fact has however not been proven formally. The existing papers study syntactic classes of programs and goals for which SLDNF-resolution is complete. We prove completeness of SLDNF-resolution for… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Stt ark. Input/output dependencies of normal logic programs

  • R F Stt
  • Journal of Logic and Computation
  • 1994

SLS-resolution without oundering

  • W Dra, Drabent
  • Proc. 2nd International Workshop on Logic…
  • 1993

Stt ark. From logic programs to inductive deenitions

  • R F Stt
  • Mathematisches Institut
  • 1993

Equivalence-preserving rst order unfold/fold transformation systems

  • T Sat, Sato
  • Theoretical Computer Science
  • 1992

Similar Papers

Loading similar papers…