5 citations · 11 across the 43 of their papers we have counts for
44 papers
Implementing Dynamic Programming in Computability Logic Web
Keehang Kwon
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 i…
Removing Qualified Names in Modular Languages
Keehang Kwon, Daeseong Kang
Although the notion of qualified names is popular in module systems, it causes severe complications. In this paper, we propose an alternative to qualified names. The key idea is to…
Evolving Recursive Definitions with Applications to Dynamic Programming
Keehang Kwon
Inspired by computability logic\cite{Jap03}, we refine recursive function definitions into two kinds: blindly-quantified (BQ) ones and parallel universally quantified (PUQ) ones. B…
A Heuristic Proof Procedure for Propositional Logic
Keehang Kwon
Theorem proving is one of the oldest applications which require heuristics to prune the search space. Invertible proof procedures has been the major tool. In this paper, we present…
Logical Pseudocode: Connecting Algorithms with Proofs
Keehang Kwon, Hyung Joon Kwon
Proofs (sequent calculus, natural deduction) and imperative algorithms (pseudocodes) are two well-known coexisting concepts. Then what is their relationship? Our answer is that \[…
What is an Algorithm?: a Modern View
Keehang Kwon
Although algorithm is one of the central subjects, there have been little common understandings of what an algorithm is. For example, Gurevich view algorithms as abstract state mac…