论文信息 - Agent-Based Proof Design via Lemma Flow Diagram

Agent-Based Proof Design via Lemma Flow Diagram

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 $shared$ cuts. This approach is modular and easy to use, read and automate. Thus, we consider LFD an appealing alternative to `flow proof' which is popular in mathematical education. Some examples are provided.

Keehang Kwon | Daeseong Kang

[1] Giorgi Japaridze. Towards applied theories based on computability logic , 2010, J. Symb. Log..

[2] Seng Wai Loke,et al. LogicWeb: Enhancing the Web with Logic Programming , 1998, J. Log. Program..

[3] Giorgi Japaridze,et al. Introduction to computability logic , 2003, Ann. Pure Appl. Log..

[4] Giorgi Japaridze,et al. On the system CL12 of computability logic , 2012, Log. Methods Comput. Sci..

[5] Keehang Kwon. Towards Distributed Logic Programming based on Computability Logic , 2019, ArXiv.

[6] Giorgi Japaridze,et al. In the Beginning was Game Semantics? , 2005, Games: Unifying Logic, Language, and Philosophy.

[7] Giorgi Japaridze. Computability Logic: a formal theory of interaction , 2004, ArXiv.