Author:
Akama Kiyoshi, ,Nantajeewarawat Ekawit,
Abstract
The common framework for formalizing state-transition computation models we present is based on a general theory for studying the interrelationship of specifications, programs, computation, and program correctness. We establish a necessary and sufficient condition for program correctness for this class of computation models and demonstrate framework application by formalizing, as its instances, two concrete examples of state-transition computation models – NAT and D-rule. We compare their correct-program spaces by introducing the embedding mapping concept.
Publisher
Fuji Technology Press Ltd.
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Human-Computer Interaction
Reference12 articles.
1. K. Akama and E. Nantajeewarawat, “Formalization of Computation Models in View of Program Synthesis,” in Proc. the 4th Int. Conf. on Intelligent Technologies, Chiang Mai, Thailand, pp. 507-516, 2003.
2. J. W. Lloyd, “Foundations of Logic Programming,” second, extended edition, Springer-Verlag, 1987.
3. T. Frühwirth, “Theory and Practice of Constraint Handling Rules,” Journal of Logic Programming, Vol.37, pp. 95-138, 1998.
4. J. Jaffar, M. Maher, K. Marriott, and P. Stuckey, “The Semantics of Constraint Logic Programs,” Journal of Logic Programming, Vol.37, pp. 1-46, 1998.
5. R. Bird, “Introduction to Functional Programming,” second edition, Prentice Hall, 1998.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献