LOGIC FOR NESTED GRAPHS

Authors
PRELLER A MUGNIER ML CHEIN M
Citation
A. Preller et al., LOGIC FOR NESTED GRAPHS, Computational intelligence, 14(3), 1998, pp. 335-357
Citations number
9
Categorie Soggetti
Computer Science Artificial Intelligence","Computer Science Artificial Intelligence
Journal title
Computational intelligence → ACNP
ISSN journal
08247935
Volume
14
Issue
3
Year of publication
1998
Pages
335 - 357
Database
ISI
SICI code
0824-7935(1998)14:3<335:>2.0.ZU;2-6
Abstract
We study the expressiveness of Nested Graphs, an extension of conceptu al 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 represe nts anaphoras in a way similar to conceptual graphs. A system of Gentz en sequents is shown to be adequate and complete with respect to proje ctions of nested graphs.