@article{Khachatryan_2014, place={Yerevan, Armenia}, title={ON OPTIMIZATION OF MONADIC LOGIC PROGRAMS}, volume={48}, url={https://journals.ysu.am/index.php/proceedings-phys-math/article/view/vol48_no1_2014_pp040-047}, DOI={10.46991/PSYU:A/2014.48.1.040}, abstractNote={<p>The article is devoted to the optimization of monadic logic programs and goals (programs and goals, which do not use functional symbols of arity $&gt;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{’}$.&nbsp; Note that the transformed program $P{’}$ is the same for all goals.</p>}, number={1 (233)}, journal={Proceedings of the YSU A: Physical and Mathematical Sciences}, author={Khachatryan, S.A.}, year={2014}, month={Apr.}, pages={40–47} }