|
Proceedings of the Yerevan State University, series Physical and Mathematical Sciences, 2014, Issue 1, Pages 40–47
(Mi uzeru49)
|
|
|
|
Informatics
On optimization of monadic logic programs
S. A. Khachatryan Yerevan State University
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^{\prime}$ and $G^{\prime}$, such that $P^{\prime}$ is terminating with respect to $G^{\prime}$ and $P \models G$, if and only if $P^{\prime}\models G^{\prime}$. Note that the transformed program $P^{\prime}$ is the same for all goals.
Keywords:
monadic logic programs, optimization, termination, transformation.
Received: 24.12.2013 Accepted: 10.02.2014
Citation:
S. A. Khachatryan, “On optimization of monadic logic programs”, Proceedings of the YSU, Physical and Mathematical Sciences, 2014, no. 1, 40–47
Linking options:
https://www.mathnet.ru/eng/uzeru49 https://www.mathnet.ru/eng/uzeru/y2014/i1/p40
|
Statistics & downloads: |
Abstract page: | 55 | Full-text PDF : | 17 | References: | 48 |
|