ON OPTIMIZATION OF MONADIC LOGIC PROGRAMS

Authors

  • S.A. Khachatryan Chair of Programming and Information Technologies, YSU, Armenia

DOI:

https://doi.org/10.46991/PSYU:A/2014.48.1.040

Keywords:

monadic logic programs, optimization, termination, transformation

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\models G$ if and only if $P{'}\models G{'}$.  Note that the transformed program $P{'}$ is the same for all goals.

Downloads

Published

2014-04-10

How to Cite

Khachatryan, S. (2014). ON OPTIMIZATION OF MONADIC LOGIC PROGRAMS. Proceedings of the YSU A: Physical and Mathematical Sciences, 48(1 (233), 40–47. https://doi.org/10.46991/PSYU:A/2014.48.1.040

Issue

Section

Informatics