Daniel Vaz dos Santos, Lucas Fernando Souza de Castro, G. V. Alves
{"title":"N-GraphML:证明图的语言和形式语法","authors":"Daniel Vaz dos Santos, Lucas Fernando Souza de Castro, G. V. Alves","doi":"10.1109/WEIT.2013.35","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":153767,"journal":{"name":"Workshop-School on Theoretical Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"N-GraphML: Language and Formal Grammar for Proof-Graphs\",\"authors\":\"Daniel Vaz dos Santos, Lucas Fernando Souza de Castro, G. V. Alves\",\"doi\":\"10.1109/WEIT.2013.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":153767,\"journal\":{\"name\":\"Workshop-School on Theoretical Computer Science\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop-School on Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WEIT.2013.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop-School on Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WEIT.2013.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
n -图是一个基于自然演绎法和相继演算规则的形式化证明系统,其中的推导通过证明图表示。N-GraphML语言是为了定义n -图的计算表示而开发的。这里我们的工作有两个目标:1 .定义N-GraphML的形式化语法;构建n -图的证明编辑器。
N-GraphML: Language and Formal Grammar for Proof-Graphs
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.