ON $SLDNF$-RESOLUTION IN LOGIC PROGRAMMING WITH NEGATION

L.A. Sargsyan

doi:10.46991/PYSU:A/2011.45.3.040

ON $SLDNF$-RESOLUTION IN LOGIC PROGRAMMING WITH NEGATION

Authors

L.A. Sargsyan Chair of Programming and Information Technologies, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSU:A/2011.45.3.040

Keywords:

logic programming, negation, built-in predicates, $SLDNF$-resolution, soundness, practical $SLDNF$-resolution

Abstract

The paper is devoted to the logic programming with negation and with built-in predicates. General logic programs (logic programs with negation) and general goals (goals with negation) are considered. Modification of SLDNF-resolution for built-in predicates is introduced. The soundness of modified SLDNF-resolution is proved. SLDNF-resolution used in real systems (practical SLDNF-resolution) is considered and the soundness of practical SLDNF-resolution is proved.

Downloads

Published

2011-10-17

How to Cite

Sargsyan, L. (2011). ON $SLDNF$-RESOLUTION IN LOGIC PROGRAMMING WITH NEGATION. Proceedings of the YSU A: Physical and Mathematical Sciences, 45(3 (226), 40–46. https://doi.org/10.46991/PYSU:A/2011.45.3.040