Relative Algorithms: Agent-Oriented Declarative Algorithms
Seongtae Kim · 2010
Normal 0 0 2 false false false EN-US KO X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:표준 표; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; mso-bidi-font-size:11.0pt; font-family:맑은 고딕; mso-ascii-font-family:맑은 고딕; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:맑은 고딕; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:맑은 고딕; mso-hansi-theme-font:minor-latin; mso-font-kerning:1.0pt;} This paper proposes a new approach to defining algorithms: the notion of relative algorithms. This notion allows the programmer to define an algorithm ( i . e . , an agent) relative to a set of other algorithms. This notion considerably simplifies the algorithm development process and can be seen as an integration of the sequential pseudo code 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 computability logic enhanced with sequential operators.