Logic for nested graphs

被引：3

作者：

Preller, A ^{[1
]}

Mugnier, ML ^{[1
]}

Chein, M ^{[1
]}

机构：

[1] LIRMM, F-34392 Montpellier, France

来源：

COMPUTATIONAL INTELLIGENCE | 1998年 / 14卷 / 03期

关键词：

knowledge representation; formal underpinnings;

D O I：

10.1111/0824-7935.00066

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We study the expressiveness of Nested Graphs, an extension of conceptual graphs. Nesting is introduced as a formal version of the intuitive "zooming in" on descriptions of individuals. Projections are defined inductively as the formal tool for "reasoning with nested graphs:" Nested graphs are translated to "colored" formulas. Coloring represents anaphoras in a way similar to conceptual graphs. A system of Gentzen sequents is shown to be adequate and complete with respect to projections of nested graphs.

引用

页码：335 / 357

页数：23

共 9 条

[1]

[Anonymous], 1984, STUDIES PROOF THEORY

[2]

Kamp H., 1993, From discourse to logic. Introduction to model-theoretic semantics of natural language

[3]

KAYSER D, 1991, NEW INQUIRIES MEANIN, P163

[4]

MUGNIER ML, 1996, REV INTELLIGENCE ART, V10, P7

[5]

Mugnier ML., 1992, REV INTELLIGENCE ART, V6, P365, DOI DOI 10.1007/BF00123690

[6]

Prawitz Dag., 1965, ACTA U STOCKHOLMIENS, V3, DOI DOI 10.2307/2271676

[7]

SIMONET G, 1996, 96047 LIRMM

[8] LOGICAL-FOUNDATIONS FOR REPRESENTING OBJECT-ORIENTED SYSTEMS [J].

SOWA, JF .

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 1993, 5 (2-3) :237-261

[9]

Sowa John F, 1984, Conceptual structures: Information processing in mind and machine

← 1 →