论文信息 - Algorithm as Defining Dynamic Systems

Algorithm as Defining Dynamic Systems

This paper proposes a new view to algorithms: Algorithms as defining dynamic systems. This view extends the traditional, deterministic view that an algorithm is a step-by-step procedure with nondeterminism. As a dynamic system can be designed by a set of its defining laws, it is also desirable to design an algorithm by a (possibly nondeterministic) set of defining laws. This observation requires some changes to algorithm development. We propose a two-step approach: the first step is to design an algorithm via a set of defining laws of dynamic system. The second step is to translate these laws (written in a natural

Keehang Kwon | Hong Pyo Ha

[1] Patrick Lincoln,et al. Linear logic , 1992, SIGA.

[2] Dale Miller,et al. Logic Programming in a Fragment of Intuitionistic Linear Logic , 1994, Inf. Comput..

[3] 番原睦則,et al. Design and implementation of linear logic programming languages , 2002 .

[4] Giorgi Japaridze,et al. The logic of tasks , 2002, Ann. Pure Appl. Log..

[5] Frank Pfenning,et al. Efficient Resource Management for Linear Logic Proof Search , 1996, ELP.

[6] Frank Pfenning,et al. Efficient resource management for linear logic proof search , 1996, Theor. Comput. Sci..

[7] Giorgi Japaridze,et al. Introduction to computability logic , 2003, Ann. Pure Appl. Log..