A Simulation of Co-identity with Rules in Simple and Nested Graphs
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 442-455
- https://doi.org/10.1007/3-540-48659-3_28
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Two FOL semantics for simple and nested conceptual graphsPublished by Springer Nature ,1998
- A platform allowing typed nested graphs: How CoGITo became CoGITaNTPublished by Springer Nature ,1998
- Sound and complete forward and backward chainings of graph rulesPublished by Springer Nature ,1996
- Computational situation theory in the conceptual graph languagePublished by Springer Nature ,1996