Expressing Algorithms as Concise as Possible via Computability Logic
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 an...
Gespeichert in:
| Veröffentlicht in: | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2014/06/01, Vol.E97.A(6), pp.1385-1387 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1387 |
|---|---|
| container_issue | 6 |
| container_start_page | 1385 |
| container_title | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| container_volume | E97.A |
| creator | KWON, Keehang |
| description | 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. |
| doi_str_mv | 10.1587/transfun.E97.A.1385 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1551090254</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1551090254</sourcerecordid><originalsourceid>FETCH-LOGICAL-c560t-bb12aa27bd96c03d63d50d61c6c85e50827a4966c8cc124a69d2a4ada163b5753</originalsourceid><addsrcrecordid>eNpdkMtOwzAQRS0EEqXwBWyyZJNgx7GTLKNSoFIlWMDamjhu6sp5YDuI_j2uChViNQ_dMxodhG4JTggr8ntvoXebqU-WZZ5UCaEFO0MzkmcsJpTm52iGS8LjguHiEl05t8OYFCnJZuhh-TVa5Zzu26gy7WC133YuAhcthl5qpw7t6xACtVHRp4aw78bJQ62N9vtoPbRaXqOLDRinbn7qHL0_Lt8Wz_H65Wm1qNaxZBz7uK5JCpDmdVNyiWnDacNww4nksmAq_JbmkJU8TFKSNANeNilk0ADhtGY5o3N0d7w72uFjUs6LTjupjIFeDZMThDGCS5yyLETpMSpteN6qjRit7sDuBcHi4Ez8OhPBmajEwVmgVkdq5zy06sSA9Voa9Z_hf9hTRm7BCtXTb7uhfTI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1551090254</pqid></control><display><type>article</type><title>Expressing Algorithms as Concise as Possible via Computability Logic</title><source>J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese</source><creator>KWON, Keehang</creator><creatorcontrib>KWON, Keehang</creatorcontrib><description>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.</description><identifier>ISSN: 0916-8508</identifier><identifier>EISSN: 1745-1337</identifier><identifier>DOI: 10.1587/transfun.E97.A.1385</identifier><language>eng</language><publisher>The Institute of Electronics, Information and Communication Engineers</publisher><subject>agents ; algorithm ; Algorithms ; computability logic ; Logic ; Tasks</subject><ispartof>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014/06/01, Vol.E97.A(6), pp.1385-1387</ispartof><rights>2014 The Institute of Electronics, Information and Communication Engineers</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c560t-bb12aa27bd96c03d63d50d61c6c85e50827a4966c8cc124a69d2a4ada163b5753</citedby><cites>FETCH-LOGICAL-c560t-bb12aa27bd96c03d63d50d61c6c85e50827a4966c8cc124a69d2a4ada163b5753</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,1877,4010,27900,27901,27902</link.rule.ids></links><search><creatorcontrib>KWON, Keehang</creatorcontrib><title>Expressing Algorithms as Concise as Possible via Computability Logic</title><title>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</title><addtitle>IEICE Trans. Fundamentals</addtitle><description>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.</description><subject>agents</subject><subject>algorithm</subject><subject>Algorithms</subject><subject>computability logic</subject><subject>Logic</subject><subject>Tasks</subject><issn>0916-8508</issn><issn>1745-1337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNpdkMtOwzAQRS0EEqXwBWyyZJNgx7GTLKNSoFIlWMDamjhu6sp5YDuI_j2uChViNQ_dMxodhG4JTggr8ntvoXebqU-WZZ5UCaEFO0MzkmcsJpTm52iGS8LjguHiEl05t8OYFCnJZuhh-TVa5Zzu26gy7WC133YuAhcthl5qpw7t6xACtVHRp4aw78bJQ62N9vtoPbRaXqOLDRinbn7qHL0_Lt8Wz_H65Wm1qNaxZBz7uK5JCpDmdVNyiWnDacNww4nksmAq_JbmkJU8TFKSNANeNilk0ADhtGY5o3N0d7w72uFjUs6LTjupjIFeDZMThDGCS5yyLETpMSpteN6qjRit7sDuBcHi4Ez8OhPBmajEwVmgVkdq5zy06sSA9Voa9Z_hf9hTRm7BCtXTb7uhfTI</recordid><startdate>2014</startdate><enddate>2014</enddate><creator>KWON, Keehang</creator><general>The Institute of Electronics, Information and Communication Engineers</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2014</creationdate><title>Expressing Algorithms as Concise as Possible via Computability Logic</title><author>KWON, Keehang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c560t-bb12aa27bd96c03d63d50d61c6c85e50827a4966c8cc124a69d2a4ada163b5753</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>agents</topic><topic>algorithm</topic><topic>Algorithms</topic><topic>computability logic</topic><topic>Logic</topic><topic>Tasks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>KWON, Keehang</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>KWON, Keehang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Expressing Algorithms as Concise as Possible via Computability Logic</atitle><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle><addtitle>IEICE Trans. Fundamentals</addtitle><date>2014</date><risdate>2014</risdate><volume>E97.A</volume><issue>6</issue><spage>1385</spage><epage>1387</epage><pages>1385-1387</pages><issn>0916-8508</issn><eissn>1745-1337</eissn><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.</abstract><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1587/transfun.E97.A.1385</doi><tpages>3</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0916-8508 |
| ispartof | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014/06/01, Vol.E97.A(6), pp.1385-1387 |
| issn | 0916-8508 1745-1337 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1551090254 |
| source | J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese |
| subjects | agents algorithm Algorithms computability logic Logic Tasks |
| title | Expressing Algorithms as Concise as Possible via Computability Logic |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T05%3A36%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Expressing%20Algorithms%20as%20Concise%20as%20Possible%20via%20Computability%20Logic&rft.jtitle=IEICE%20Transactions%20on%20Fundamentals%20of%20Electronics,%20Communications%20and%20Computer%20Sciences&rft.au=KWON,%20Keehang&rft.date=2014&rft.volume=E97.A&rft.issue=6&rft.spage=1385&rft.epage=1387&rft.pages=1385-1387&rft.issn=0916-8508&rft.eissn=1745-1337&rft_id=info:doi/10.1587/transfun.E97.A.1385&rft_dat=%3Cproquest_cross%3E1551090254%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1551090254&rft_id=info:pmid/&rfr_iscdi=true |