2013; Physical and Mathematical Sciences, 47(3 (232): 49–56
Shared with The Gufo

ON TERMINATION OF FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS

S.A. Khachatryan*

Received: 2025-02-17 · Published: 2013-11-20

© 2013 The Author(s) and the original publisher.

CC BY 4.0 This work is licensed under a Creative Commons Attribution 4.0 International License.
Shared article.
Original title
ON TERMINATION OF FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS
Author
S.A. Khachatryan
Published
2013-11-20
Licence
Creative Commons Attribution 4.0 International
Original
https://doi.org/10.46991/PYSUA.2013.47.3.049

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 Δ-equivalent.
1 / ? 100% Open in new tab Download Cite

Loading the full text…

Download Follow Updates