Abstract
This paper presents graph operations for processing conceptual graph rules in forward chaining and backward chaining. In both cases the operations provide sound and complete procedures with respect to first-order logic deduction. First we present our framework: simple conceptual graphs, rules as couples of lambda-abstractions, knowledge base, logical semantics. Next we focus on forward chaining. In particular, using the notion of redundancy, we exactly characterize when the application of a rule to a graph enriches or not this graph with a “new” information. The forward mechanism is complete if the knowledge base is in normal form. Basic notions (cut points, pieces, compatible partitions, unification) for backward chaining are detailed. A parallel with previous works on backward chaining is done, in particular with the work of B.C. Ghosh and V. Wuwongse, which is close to ours. The main difference is that we do not split the goals into trivial subgraphs (a relation and its neighbours). Instead, we determine cut points, which define arbitrary complex subgraphs, called pieces, that can be processed as a whole.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Chein, J. Bouaud, J.P. Chevallet, R. Dieng, B. Levrat, and G. Sabah. Graphes Conceptuels. In Actes des 5emes Journees Nationales du PRC-GDR Intelligence Artificielle, pages 179–212, 1995.
O. Cogis and O. Guinaldo. A Linear Descriptor for Conceptual Graphs and a Class for Polynomial Isomorphism Test. In Lecture Notes in AI, 954, Proceedings of ICCS'95, pages 263–277. Springer Verlag, 1995.
M. Chein and M.L. Mugnier. Conceptual Graphs: fundamental notions. Revue d'Intelligence Artificielle, 6(4), 1992. In english.
M. Chein and M.L. Mugnier. Conceptual graphs are also graphs. Research Report 95-004, LIRMM, Jan. 1995. 17 pages.
A. Colmerauer. Prolog in ten figures. In Proceedings IJCAI'83, Vol. 1, pages 487–497, 1983.
J. Fargues, M.C. Landau, A. Dugourd, and L. Catach. Conceptual Graphs for Semantics and Information Processing. IBM Journal of Research and Development, 30(1):70–79, 1986.
B.C. Ghosh and V. Wuwongse. A direct Proof Procedure for Definite Conceptual Graph programs. In Lecture Notes in AI, 954, Proceedings of ICCS'95, pages 158–172. Springer Verlag, 1995.
M.L. Mugnier and M. Chein. Characterization and Algorithmic Recognition of Canonical Conceptual Graphs. In Lecture Notes in AI, 699, Proceedings ICCS'93, pages 294–311. Springer Verlag, 1993.
M.L. Mugnier and M. Chein. Représenter des connaissances et raisonner avec des graphes. Revue d'Intelligence Artificielle, 10(1), 1996.
A.S. Rao and N. Foo. Conceptual Graph Reasoning System. In Proceedings of the 3rd CAIA, pages 87–92. IEEE Computer Society Press, 1987.
J.F. Sowa. Conceptual Structures — Information Processing in Mind and Machine. Addison-Wesley, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salvat, E., Mugnier, ML. (1996). Sound and complete forward and backward chainings of graph rules. In: Eklund, P.W., Ellis, G., Mann, G. (eds) Conceptual Structures: Knowledge Representation as Interlingua. ICCS 1996. Lecture Notes in Computer Science, vol 1115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61534-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-61534-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61534-7
Online ISBN: 978-3-540-68730-6
eBook Packages: Springer Book Archive