# Implementing Dynamic Programming in Computability Logic Web

arXiv: https://arxiv.org/abs/2304.01539 · HTML: https://mlsanity.com/paper/2304.01539/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 3 references that are in the map.
- First posted on arXiv 4 Apr 2023.

## Abstract (arXiv)

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 it automatic memoization.