2014; Physical and Mathematical Sciences, 48(1 (233): 40–47
Shared with The Gufo

ON OPTIMIZATION OF MONADIC LOGIC PROGRAMS

S.A. Khachatryan*

Received: 2025-02-17 · Published: 2014-04-10

© 2014 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 OPTIMIZATION OF MONADIC LOGIC PROGRAMS
Author
S.A. Khachatryan
Published
2014-04-10
Licence
Creative Commons Attribution 4.0 International
Original
https://doi.org/10.46991/PYSUA.2014.48.1.040

Abstract

The article is devoted to the optimization of monadic logic programs and goals (programs and goals, which do not use functional symbols of arity >1 and use only predicate symbols of arity 1). A program P is terminating with respect to a goal G if an SLD-tree of P and G is finite. In general, monadic programs are not terminating. Program and goal transformations are introduced, by which a monadic program P and a variable-free monadic goal G are transformed into P′ and G′, such that P′ is terminating with respect to G′ and P⊨G if and only if P′⊨G′.  Note that the transformed program P′ is the same for all goals.
1 / ? 100% Open in new tab Download Cite

Loading the full text…

Download Follow Updates