On termination of functional symbol-free logic programs
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 3 (2013), pp. 49-56
Voir la notice de l'article provenant de la source Math-Net.Ru
The present article is devoted to the termination of logic programs, which do not use functional symbols ($FSF$ programs). A program $P$ is terminating with respect to a goal $G$, if the $SLD$-tree of $P$ and $G$ is finite. In general, $FSF$ programs are not terminating. A transformation is introduced, by which any $FSF$ program is transformed into another, not $FSF$ program, which is shown to be terminating with respect to the permitted goals of the original program. The program obtained via transformation and the original program are $\Delta$-equivalent.
Keywords:
logic programming, functional symbol-free logic programs
Mots-clés : termination, transformation.
Mots-clés : termination, transformation.
@article{UZERU_2013_3_a7,
author = {S. A. Khachatryan},
title = {On termination of functional symbol-free logic programs},
journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
pages = {49--56},
publisher = {mathdoc},
number = {3},
year = {2013},
language = {en},
url = {http://geodesic.mathdoc.fr/item/UZERU_2013_3_a7/}
}
TY - JOUR AU - S. A. Khachatryan TI - On termination of functional symbol-free logic programs JO - Proceedings of the Yerevan State University. Physical and mathematical sciences PY - 2013 SP - 49 EP - 56 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/UZERU_2013_3_a7/ LA - en ID - UZERU_2013_3_a7 ER -
S. A. Khachatryan. On termination of functional symbol-free logic programs. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 3 (2013), pp. 49-56. http://geodesic.mathdoc.fr/item/UZERU_2013_3_a7/