Expressing Algorithms as Concise as Possible via Computability Logic-Reference-Cited by-同舟云学术

Expressing Algorithms as Concise as Possible via Computability Logic

Published:2014 Issue:6 Volume:E97.A Page:1385-1387
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

KWON Keehang¹

Affiliation:

1. Department of Computer Eng., DongA University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E97.A/6/E97.A_1385/_pdf

Reference12 articles.

1. [1] M. Banbara. Design and implementation of linear logic programming languages, Ph.D. Dissertation, Kobe University, 2002.

2. [2] I. Cervesato, J.S. Hodas, and F. Pfenning, “Efficient resource management for linear logic proof search,” Proc. 1996 Workshop on Extensions of Logic Programming, LNAI 1050, pp.67-81.

3. [3] J.-Y. Girard, Linear logic, Theoretical Computer Science, vol.50, pp.1-102, 1987.

4. [4] Y. Grevich, “What is an algorithm?,” Micosoft TR-MSR-TR-2011-116, 2011.

5. [5] J. Hodas and D. Miller, “Logic programming in a fragment of intuitionistic linear logic,” J. Information and Computation, 1994.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The emergence of compositionality in a brain-inspired cognitive architecture;Cognitive Systems Research;2024-08

2. The emergence of enhanced intelligence in a brain-inspired cognitive architecture;Frontiers in Computational Neuroscience;2024-05-07

3. An analogical inductive solution to the grounding problem;Cognitive Systems Research;2023-01