Top > JACIII > Formalization of the Equivalent Transformation Computation Mod ...

single-jc.php

JACIII Vol.10 No.3 pp. 245-259
doi: 10.20965/jaciii.2006.p0245
(2006)

Paper:

Views over last 60 days: 465

Formalization of the Equivalent Transformation Computation Model

Kiyoshi Akama*, and Ekawit Nantajeewarawat**

*Division of Large-Scale Computational Systems, Information Initiative Center, Hokkaido University, Kita 11 Nishi 5, Kita-ku, Sapporo, Hokkaido 060-0811, Japan

**Computer Science Program, Sirindhorn International Institute of Technology, Thammasat University, P.O. Box 22, Thammasat-Rangsit Post Office, Rangsit Campus, Pathumthani 12121, Thailand

Received:
February 22, 2005
Accepted:
December 21, 2005
Published:
May 20, 2006
Creative Commons License
Keywords:
computation model, equivalent transformation, program synthesis, program correctness, rule-based computation
Abstract
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain and defines a set of queries of interest. A program is a set of prioritized transformation rules, and computation consists in successive reduction of queries using meaning-preserving transformation with respect to given background knowledge. We present a formalization of the ET model from the viewpoint of program synthesis, where not only computation but also program correctness and correctness relations are of central importance. The notion of program correctness defines “what it means for a program to be correct with respect to a specification,” and a correctness relation provides guidance on “how to obtain such a program.” The correctness relation of the ET model is established, based on which how the basic structure of the ET model facilitates program synthesis is discussed together with program synthesis strategies in this model.
Cite this article as:
K. Akama and E. Nantajeewarawat, “Formalization of the Equivalent Transformation Computation Model,” J. Adv. Comput. Intell. Intell. Inform., Vol.10 No.3, pp. 245-259, 2006.
Data files:
References
  1. [1] K. Akama, “Semantic Processing of Natural Language Sentences by Equivalent Transformation,” Hokkaido University Information Engineering Technical Report, HIER-LI-9225, 1992.
  2. [2] K. Akama, Y. Nomura, and E. Miyamoto, “Semantic Interpretation of Natural Language Descriptions by Program Transformation,” Computer Software, Vol.12, No.5, pp. 45-62, 1995.
  3. [3] C. Anutariya et al., “RDF Declarative Description (RDD): A Language for Metadata,” Journal of Digital Information, Vol.2, No.2, 2001.
  4. [4] E. Nantajeewarawat et al., “Toward Reasoning with Unified Modeling Language Diagrams Based-on Extensible Markup Language Declarative Description Theory,” International Journal of Intelligent Systems, Vol.19, pp. 89-98, 2004.
  5. [5] V. Wuwongse et al., “A Data Model for XML Databases,” Journal of Intelligent Information Systems, Vol.20, No.1, pp. 63-80, 2003.
  6. [6] K. Akama, T. Shimizu, and E. Miyamoto, “Solving Problems by Equivalent Transformation of Declarative Programs,” Journal of the Japanese Society for Artificial Intelligence, Vol.13, pp. 944-952, 1998.
  7. [7] K. Akama, E. Nantajeewarawat, and H. Koike, “A Class of Rewriting Rules and Reverse Transformation for Rule-Based Equivalent Transformation,” Electronic Notes in Theoretical Computer Science, Vol.59, No.4, pp. 1-16, 2001.
  8. [8] K. Akama, E. Nantajeewarawat, and H. Koike, “Program Synthesis Based on the Equivalent Transformation Computation Model,” in Proc. the 12th Intl. Workshop on Logic Based Program Synthesis and Transformation, Madrid, Spain, pp. 285-304, 2002.
  9. [9] J. W. Lloyd, “Foundations of Logic Programming,” second, extended edition, Springer-Verlag, 1987.
  10. [10] T. Frühwirth, “Theory and Practice of Constraint Handling Rules,” Journal of Logic Programming, Vol.37, pp. 95-138, 1998.
  11. [11] J. Jaffar et al., “The Semantics of Constraint Logic Programs,” Journal of Logic Programming, Vol.37, pp. 1-46, 1998.
  12. [12] P. Hudak, “Conception, Evolution and Application of Functional Programming Languages,” ACM Computing Surveys, Vol.21, No.3, pp. 359-411, 1989.
  13. [13] K. Akama, and E. Nantajeewarawat, “Formalization of Computation Models in View of Program Synthesis,” in Proc. the 4th Intl. Conference on Intelligent Technologies, Chiang Mai, Thailand, pp. 507-516, 2003.
  14. [14] A. Pettorossi, and M. Proietti, “Rules and Strategies for Transforming Functional and Logic Programs,” ACM Computing Surveys, Vol.28, No.2, pp. 360-414, 1996.
  15. [15] A. Pettorossi, and M. Proietti, “Transformation of Logic Programs,” in D. M. Gabbay, C. J. Hogger, and J. A. Robinson, Eds., Handbook of Logic in Artificial Intelligence and Logic Programming, Vol.5, Oxford University Press, pp. 697-787, 1998.
  16. [16] K. Akama, and E. Nantajeewarawat, “Computation Frameworks, Program Synthesis, and Correctness Relations,” Technical Report, Information Initiative Center, Hokkaido University, 2004.
  17. [17] J. Woodcock, and J. Davies, “Using Z Specification, Refinement and Proof,” Prentice Hall, 1996.
  18. [18] C. Morgan, “Programming from Specifications,” International Series in Computer Science, Prentice Hall, 1994.
  19. [19] J. M. Morris, “A Theoretical Basis for Stepwise Refinement and the Programming Calculus,” Science of Computer Programming, Vol.9, No.3, pp. 287-306, 1987.
  20. [20] N. Wirth, “Program Development by Stepwise Refinement,” Communications of the ACM, Vol.14, No.4, pp. 221-227, 1971.
  21. [21] Y. Gurevich, “Sequential Abstract-State Machines Capture Sequential Algorithms,” ACM Transactions on Computational Logic, Vol.1, No.1, pp. 77-111, 2000.
  22. [22] K. Akama, and E. Nantajeewarawat, “Formalization of the Constraint Logic Programming Computation Model,” Technical Report, Information Initiative Center, Hokkaido University, 2004.
  23. [23] H. Koike, K. Akama, and E. Boyd, “Program Synthesis by Generating Equivalent Transformation Rules,” in Proc. the 2nd Intl.Conference on Intelligent Technologies, Bangkok, Thailand, pp. 250-259, 2001.
  24. [24] I. Takarajima et al., “Design of Termination for Non-Deterministic Programs Based on the Equivalent Transformation Computation Model,” in Proc. the 5th Intl. Conference on Intelligent Technologies, Houston, Texas, pp. 226-235, 2004.

Creative Commons License  This article is published under a Creative Commons Attribution-NoDerivatives 4.0 Internationa License.

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Apr. 18, 2024