Implementing Dynamic Programming in Computability Logic Web

04/04/2023

∙

by   Keehang Kwon, et al.

∙

0

∙

share

We present a novel definition of an algorithm and its corresponding algorithm language called CoLweb. The merit of CoLweb [1] is that it makes algorithm design so versatile. That is, it forces us to a high-level, proof-carrying, distributed-style approach to algorithm design for both non-distributed computing and distributed one. We argue that this approach simplifies algorithm design. In addition, it unifies other approaches including recursive logical/functional algorithms, imperative algorithms, object-oriented imperative algorithms, neural-nets, interaction nets, proof-carrying code, etc. As an application, we refine Horn clause definitions into two kinds: blind-univerally-quantified (BUQ) ones and parallel-universally-quantified (PUQ) ones. BUQ definitions corresponds to the traditional ones such as those in Prolog where knowledgebase is not expanding and its proof procedure is based on the backward chaining. On the other hand, in PUQ definitions, knowledgebase is expanding and its proof procedure leads to forward chaining and automatic memoization.