9 papers
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…
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.…
A Concurrent Model for Imperative Languages with Improved Atomicity
Keehang Kwon, Daeseong Kang
We propose a new concurrent model for imperative languages where concurrency occurs at a subprogram level. This model introduces a new {\it block sequential} statement of the form…
Local Modules in Imperative Languages
Keehang Kwon, Daeseong Kang
We propose a notion of local modules for imperative langauges. To be specific, we introduce a new implication statement of the form where is a module (i.e., a set…
Towards a Decidable LogicWeb via Length-Bounded Derivations
Keehang Kwon, Daeseong Kang
LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A…
Sequential Operations in LogicWeb
Daeseong Kang, Keehang Kwon, Zulkarnine Mahmud
Sequential tasks cannot be effectively handled in logic programming based on classical logic or linear logic. This limitation can be addressed by using a fragment of Japaridze'sSeq…
Bounded-Choice Statements for User Interaction in Imperative and Object-Oriented Programming
Keehang Kwon, Jeongyoon Seo, Daeseong Kang
Adding versatile interactions to imperative programming -- C, Java and Android -- is an essential task. Unfortunately, existing languages provide only limited constructs for user i…
Mutually Exclusive Rules in LogicWeb
Keehang Kwon, Daeseong Kang
LogicWeb has traditionally lacked devices for expressing mutually exclusive clauses. We address this limitation by adopting choice-conjunctive clauses of the form $D_0 \adc D_1$ wh…
Choice Disjunctive Queries in Logic Programming
Keehang Kwon, Daeseong Kang
One of the long-standing research problems on logic programming is to treat the cut predicate in a logical, high-level way. We argue that this problem can be solved by adopting lin…