IEICE TRANSACTIONS on Fundamentals
Expressing Algorithms as Concise as Possible via Computability Logic
Summary :
This paper proposes a new approach to defining and expressing algorithms: the notion of task logical algorithms. This notion allows the user to define an algorithm for a task T as a set of agents who can collectively perform T. This notion considerably simplifies the algorithm development process and can be seen as an integration of the sequential pseudocode and logical algorithms. This observation requires some changes to algorithm development process. We propose a two-step approach: the first step is to define an algorithm for a task T via a set of agents that can collectively perform T. The second step is to translate these agents into (higher-order) computability logic.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.6 pp.1385-1387
- Publication Date
- 2014/06/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E97.A.1385
- Type of Manuscript
- Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keehang KWON
DongA University
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
Keehang KWON, "Expressing Algorithms as Concise as Possible via Computability Logic" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 6, pp. 1385-1387, June 2014, doi: 10.1587/transfun.E97.A.1385.
Abstract: This paper proposes a new approach to defining and expressing algorithms: the notion of task logical algorithms. This notion allows the user to define an algorithm for a task T as a set of agents who can collectively perform T. This notion considerably simplifies the algorithm development process and can be seen as an integration of the sequential pseudocode and logical algorithms. This observation requires some changes to algorithm development process. We propose a two-step approach: the first step is to define an algorithm for a task T via a set of agents that can collectively perform T. The second step is to translate these agents into (higher-order) computability logic.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.1385/_p
Copy
@ARTICLE{e97-a_6_1385,
author={Keehang KWON, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Expressing Algorithms as Concise as Possible via Computability Logic},
year={2014},
volume={E97-A},
number={6},
pages={1385-1387},
abstract={This paper proposes a new approach to defining and expressing algorithms: the notion of task logical algorithms. This notion allows the user to define an algorithm for a task T as a set of agents who can collectively perform T. This notion considerably simplifies the algorithm development process and can be seen as an integration of the sequential pseudocode and logical algorithms. This observation requires some changes to algorithm development process. We propose a two-step approach: the first step is to define an algorithm for a task T via a set of agents that can collectively perform T. The second step is to translate these agents into (higher-order) computability logic.},
keywords={},
doi={10.1587/transfun.E97.A.1385},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - Expressing Algorithms as Concise as Possible via Computability Logic
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1385
EP - 1387
AU - Keehang KWON
PY - 2014
DO - 10.1587/transfun.E97.A.1385
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2014
AB - This paper proposes a new approach to defining and expressing algorithms: the notion of task logical algorithms. This notion allows the user to define an algorithm for a task T as a set of agents who can collectively perform T. This notion considerably simplifies the algorithm development process and can be seen as an integration of the sequential pseudocode and logical algorithms. This observation requires some changes to algorithm development process. We propose a two-step approach: the first step is to define an algorithm for a task T via a set of agents that can collectively perform T. The second step is to translate these agents into (higher-order) computability logic.
ER -
English
