On $SLDNF$-resolution in logic programming with negation
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 3 (2011), pp. 40-46
Cet article a éte moissonné depuis la source Math-Net.Ru
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.
Keywords:
logic programming, negation, built-in predicates, $SLDNF$-resolution, soundness, practical $SLDNF$-resolution.
@article{UZERU_2011_3_a5,
author = {L. A. Sargsyan},
title = {On $SLDNF$-resolution in logic programming with negation},
journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
pages = {40--46},
year = {2011},
number = {3},
language = {en},
url = {http://geodesic.mathdoc.fr/item/UZERU_2011_3_a5/}
}
L. A. Sargsyan. On $SLDNF$-resolution in logic programming with negation. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 3 (2011), pp. 40-46. http://geodesic.mathdoc.fr/item/UZERU_2011_3_a5/