N-GRAPHML: Language and Formal Grammar for Proof-Graphs

被引：0
|
作者：
dos Santos, Daniel Vaz [1 ]
Souza de Castro, Lucas Fernando [1 ]
Alves, Gleifer Vaz [1 ]
机构：
[1] Fed Technol Univ Parana, Acad Dept Informat, Ponta Grossa, Brazil
来源：
2013 2ND WORKSHOP-SCHOOL ON THEORETICAL COMPUTER SCIENCE (WEIT) | 2013年
关键词：
Proof-graphs; N-Graphs; N-GraphML;
D O I：
10.1109/WEIT.2013.35
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
N-Graphs is a formal proof system based on natural deduction and sequent calculus rules, where derivations are represented via proof-graphs. The N-GraphML language has been developed in order to define a computational representation for N-Graphs. Here our work has a two-fold goal: i. define a formal grammar for N-GraphML; ii. build a proof editor for N-Graphs.
引用
收藏
页码：135 / 138
页数：4
相关论文
共 42 条
12345