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 条

[21] Mdws:: A modelling language to build a formal ontology in either description logics or conceptual graphs
Nobécourt, J
Biébow, B
KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT, PROCEEDINGS: METHODS, MODELS, AND TOOLS, 2000, 1937 : 57 - 64
[22] LOGIC AS GRAMMAR, AN APPROACH TO MEANING IN NATURAL-LANGUAGE - HORNSTEIN,N
NISHIYAMA, S
STUDIES IN ENGLISH LITERATURE-TOKYO, 1986, 63 (02): : 393 - 398
[23] LOGIC AS GRAMMAR - AN APPROACH TO MEANING IN NATURAL-LANGUAGE - HORNSTEIN,N
DELFITTO, D
LINGUA E STILE, 1985, 20 (04) : 521 - 528
[24] Dynamic Sign Language Recognition for Smart Home Interactive Application Using Stochastic Linear Formal Grammar
Abid, Muhammad Rizwan
Petriu, Emil M.
Amjadian, Ehsan
IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2015, 64 (03) : 596 - 605
[25] From natural language to formal proof goal - Structured goal formalisation applied to medical guidelines
Stegers, Ruud
ten Teije, Annette
van Harmelen, Rank
MANAGING KNOWLEDGE IN A WORLD OF NETWORKS, PROCEEDINGS, 2006, 4248 : 51 - 58
[26] PROOF OF SLATERS CONJECTURE ON K-CRITICAL N-CONNECTED GRAPHS
SU, JJ
KEXUE TONGBAO, 1988, 33 (20): : 1675 - 1678
[27] PROOF OF SLATER'S CONJECTURE ON k-CRITICAL n-CONNECTED GRAPHS
苏健基
Science Bulletin, 1988, (20) : 1675 - 1678
[28] Proof of Mader's conjecture on k-critical n-connected graphs
Su, JJ
JOURNAL OF GRAPH THEORY, 2004, 45 (04) : 281 - 297
[29] FROM FORMAL LOGIC TO "LIVING GRAMMAR": IDEAS OF F. BUSLAEV IN THE MODERN THEORY AND PRACTICE OF TEACHING THE RUSSIAN LANGUAGE
Konovalova, N., I
PHILOLOGICAL CLASS, 2018, 52 (02): : 59 - 63
[30] Formal validation of data-parallel programs: a two-component assertional proof system for a simple language
Bouge, L
Cachera, D
LeGuyadec, Y
Utard, G
Virot, B
THEORETICAL COMPUTER SCIENCE, 1997, 189 (1-2) : 71 - 107

← 1 2 3 4 5 →