ON TERMINATION OF FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS
DOI:
https://doi.org/10.46991/PYSU:A/2013.47.3.049Keywords:
logic programming, termination, functional symbol-free logic programs, transformationAbstract
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.
Downloads
Published
2013-11-20
How to Cite
Khachatryan, S. (2013). ON TERMINATION OF FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS. Proceedings of the YSU A: Physical and Mathematical Sciences, 47(3 (232), 49–56. https://doi.org/10.46991/PYSU:A/2013.47.3.049
Issue
Section
Informatics
License
Copyright (c) 2013 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.