154 citations
- Czech Academy of Sciences, Institute of MathematicsCZ2 papers
- Dong A University2 papers
- Florida State UniversityUS2 papers
- Kyungsung UniversityKR2 papers
- University of TorontoCA2 papers
- Czech Academy of SciencesCZ1 paper
- Environmental and Occupational Health Sciences InstituteUS1 paper
- Institut de Mathématiques de ToulonFR1 paper
- Kyungil UniversityKR1 paper
- Kyungpook National UniversityKR1 paper
- National Institute for Mathematical SciencesKR1 paper
- Rutgers, The State University of New JerseyUS1 paper
8 papers · 1 filter
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…
Agent-Based Proof Design via Lemma Flow Diagram
Keehang Kwon, Daeseong Kang
We discuss an agent-based approach to proof design and implementation, which we call {\it Lemma Flow Diagram} (LFD). This approach is based on the multicut rule with cuts.…
Priority, Cut, If-Then-Else and Exception Handling in Logic Programming
Keehang Kwon
One of the long-standing problems on logic programming is to express {\it priority}-related operations -- default reasoning, if-then-else, cut, exception handling, etc -- in a high…
Incorporating Inductions and Game Semantics into Logic Programming
Keehang Kwon
Inductions and game semantics are two useful extensions to traditional logic programming. To be specific, inductions can capture a wider class of provable formulas in logic program…
A New Execution Model for the logic of hereditary Harrop formulas
Keehang Kwon
The class of first-order Hereditary Harrop formulas () is a well-established extension of first-order Horn clauses. Its operational semantics is based on intuitionistic prova…
Expressing Algorithms As Concise As Possible via Computability Logic
Keehang Kwon
This paper proposes a new approach to defining and expressing algorithms: the notion of {\it task logical} algorithms. This notion allows the user to define an algorithm for a task…