On Relationships between Decomposable Programs and Rule Commutative Programs
Summary :
This paper discusses the relationships of two important program classes of linearly recursive programs, that is, decomposable programs and rule commutative programs. We prove that the decomposable programs are always rule commutative. Furthermore, the rule commutative programs that satisfy certain conditions are decomposable. These results are meaningful for integrating the related specified optimization algorithms.
- Publication
- IEICE TRANSACTIONS on Information Vol.E80-D No.6 pp.684-686
- Publication Date
- 1997/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Databases
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Xiaoyong DU, Zhibin LIU, Naohiro ISHII, "On Relationships between Decomposable Programs and Rule Commutative Programs" in IEICE TRANSACTIONS on Information,
vol. E80-D, no. 6, pp. 684-686, June 1997, doi: .
Abstract: This paper discusses the relationships of two important program classes of linearly recursive programs, that is, decomposable programs and rule commutative programs. We prove that the decomposable programs are always rule commutative. Furthermore, the rule commutative programs that satisfy certain conditions are decomposable. These results are meaningful for integrating the related specified optimization algorithms.
URL: https://global.ieice.org/en_transactions/information/10.1587/e80-d_6_684/_p
Copy
@ARTICLE{e80-d_6_684,
author={Xiaoyong DU, Zhibin LIU, Naohiro ISHII, },
journal={IEICE TRANSACTIONS on Information},
title={On Relationships between Decomposable Programs and Rule Commutative Programs},
year={1997},
volume={E80-D},
number={6},
pages={684-686},
abstract={This paper discusses the relationships of two important program classes of linearly recursive programs, that is, decomposable programs and rule commutative programs. We prove that the decomposable programs are always rule commutative. Furthermore, the rule commutative programs that satisfy certain conditions are decomposable. These results are meaningful for integrating the related specified optimization algorithms.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - On Relationships between Decomposable Programs and Rule Commutative Programs
T2 - IEICE TRANSACTIONS on Information
SP - 684
EP - 686
AU - Xiaoyong DU
AU - Zhibin LIU
AU - Naohiro ISHII
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E80-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1997
AB - This paper discusses the relationships of two important program classes of linearly recursive programs, that is, decomposable programs and rule commutative programs. We prove that the decomposable programs are always rule commutative. Furthermore, the rule commutative programs that satisfy certain conditions are decomposable. These results are meaningful for integrating the related specified optimization algorithms.
ER -
English
