On functional symbol-free logic programs
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2012), pp. 43-48
Voir la notice de l'article provenant de la source Math-Net.Ru
In the present article logic programs (both with and without negation) that do not use functional symbols are studied. Three algorithmic problems for functional symbol-free programs are investigated: the existence of a solvable interpreter, the problem of $\Delta$-equivalence and the problem of logical equivalence. The first two problems are known to be decidable for functional symbol-free definite programs. We show that the third one is also decidable for such programs. In contrast, all three problems are shown to be undedicable for functional symbol-free general programs.
Keywords:
logic programming, functional symbol-free programs, algorithmic problems.
@article{UZERU_2012_1_a7,
author = {L. A. Haykazyan},
title = {On functional symbol-free logic programs},
journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
pages = {43--48},
publisher = {mathdoc},
number = {1},
year = {2012},
language = {en},
url = {http://geodesic.mathdoc.fr/item/UZERU_2012_1_a7/}
}
L. A. Haykazyan. On functional symbol-free logic programs. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2012), pp. 43-48. http://geodesic.mathdoc.fr/item/UZERU_2012_1_a7/