|
Proceedings of the Yerevan State University, series Physical and Mathematical Sciences, 2013, Issue 3, Pages 49–56
(Mi uzeru82)
|
|
|
|
Informatics
On termination of functional symbol-free logic programs
S. A. Khachatryan Yerevan State University
Abstract:
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, termination, functional symbol-free logic programs, transformation.
Received: 05.09.2013 Accepted: 30.09.2013
Citation:
S. A. Khachatryan, “On termination of functional symbol-free logic programs”, Proceedings of the YSU, Physical and Mathematical Sciences, 2013, no. 3, 49–56
Linking options:
https://www.mathnet.ru/eng/uzeru82 https://www.mathnet.ru/eng/uzeru/y2013/i3/p49
|
Statistics & downloads: |
Abstract page: | 73 | Full-text PDF : | 19 | References: | 49 |
|