ON TERMINATION OF FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS

Author(s)

ON TERMINATION OF FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS S.A. Khachatryan

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.

DOI: 10.46991/PYSUA.2013.47.3.049 Physical and Mathematical Sciences, 47(3 (232) 49-56

Download PDF

Keywords

logic programming, termination, functional symbol-free logic programs, transformation

Check for updates

Share

Contact admin with any questions, comments or concerns

[email protected]