| Título: | Relative Algorithms: Agent-Oriented Declarative Algorithms |
| Autores: | Seongtae Kim |
| Fecha: | 2010-07-05 |
| Publicador: | International Journal of Computer Science Letters |
| Fuente: |
 |
| Tipo: | |
| Tema: | tasks;algorithm;agents;computability logic |
| Descripción: | <!-- /* Font Definitions */ @font-face {font-family:"Cambria Math"; panose-1:2 4 5 3 5 4 6 3 2 4; mso-font-charset:0; mso-generic-font-family:roman; mso-font-pitch:variable; mso-font-signature:-1610611985 1107304683 0 0 159 0;} @font-face {font-family:"맑은 고딕"; panose-1:2 11 5 3 2 0 0 2 0 4; mso-font-charset:129; mso-generic-font-family:modern; mso-font-pitch:variable; mso-font-signature:-1879047505 165117179 18 0 524289 0;} @font-face {font-family:Vijaya; mso-font-alt:Arial; mso-font-charset:0; mso-generic-font-family:swiss; mso-font-pitch:variable; mso-font-signature:3 0 0 0 1 0;} @font-face {font-family:"Lucida Calligraphy"; panose-1:3 1 1 1 1 1 1 1 1 1; mso-font-charset:0; mso-generic-font-family:script; mso-font-pitch:variable; mso-font-signature:3 0 0 0 1 0;} @font-face {font-family:"\@맑은 고딕"; panose-1:2 11 5 3 2 0 0 2 0 4; mso-font-charset:129; mso-generic-font-family:modern; mso-font-pitch:variable; mso-font-signature:-1879047505 165117179 18 0 524289 0;} /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-unhide:no; mso-style-qformat:yes; mso-style-parent:""; margin:0cm; margin-bottom:.0001pt; text-align:justify; text-justify:inter-ideograph; mso-pagination:none; text-autospace:none; word-break:break-hangul; 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-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi; mso-font-kerning:1.0pt;} .MsoChpDefault {mso-style-type:export-only; mso-default-props:yes; mso-ascii-font-family:"맑은 고딕"; mso-ascii-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} /* Page Definitions */ @page {mso-page-border-surround-header:no; mso-page-border-surround-footer:no;} @page Section1 {size:612.0pt 792.0pt; margin:3.0cm 72.0pt 72.0pt 72.0pt; mso-header-margin:36.0pt; mso-footer-margin:36.0pt; mso-paper-source:0;} div.Section1 {page:Section1;} --> 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. |
| Idioma: | Inglés |