Abstract
Conceptual Graphs Rules were proposed as an extension of Simple Conceptual Graphs (CGs) to represent knowledge of form “if A then B”, where A and B are simple CGs. Optimizations of the deduction calculus in this KR formalism include a Backward Chaining that unifies at the same time whole subgraphs of a rule, and a Forward Chaining that relies on compiling dependencies between rules.
In this paper, we show that the unification used in the first algorithm is exactly the operation required to compute dependencies in the second one. We also combine the benefits of the two approaches, by using the graph of rules dependencies in a Backward Chaining framework.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Baget, J.-F.: Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS (LNAI), vol. 2746. Springer, Heidelberg (2003)
Baget, J.-F., Mugnier, M.-L.: The Complexity of Rules and Constraints. JAIR 16, 425–465 (2002)
Baget, J.-F.: Improving the forward chaining algorithm for conceptual graphs rules. In: Proc. of KR2004, pp. 407–414. AAAI Press, Menlo Park (2004)
Chein, M., Mugnier, M.-L.: Conceptual Graphs: Fundamental Notions. Revue d’Intelligence Artificielle 6(4), 365–406 (1992)
Chein, M., Mugnier, M.-L.: Types and Coreference in Simple Conceptual Graphs. In: Wolff, K.E., Pfeiffer, H.D., Delugach, H.S. (eds.) ICCS 2004. LNCS (LNAI), vol. 3127, pp. 303–318. Springer, Heidelberg (2004)
Coulondre, S., Salvat, E.: Piece resolution: Towards larger perspectives. In: Mugnier, M.-L., Chein, M. (eds.) ICCS 1998. LNCS (LNAI), vol. 1453, pp. 179–193. Springer, Heidelberg (1998)
Mugnier, M.-L.: Knowledge Representation and Reasoning based on Graph Homomorphism. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 172–192. Springer, Heidelberg (2000)
Mugnier, M.-L., Chein, M.: Représenter des connaissances et raisonner avec des graphes. Revue d’Intelligence Artificielle 10(1), 7–56 (1996)
Salvat, E.: Theorem proving using graph operations in the conceptual graphs formalism. In: Proc. of ECAI 1998, pp. 356–360 (1998)
Salvat, E., Mugnier, M.-L.: Sound and Complete Forward and Backward Chainings of Graph Rules. In: ICCS 1996. LNCS (LNAI), vol. 1115, pp. 248–262. Springer, Heidelberg (1996)
Sowa, J.F.: Conceptual Graphs. IBM Journal of Research and Development (1976)
Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baget, JF., Salvat, É. (2006). Rules Dependencies in Backward Chaining of Conceptual Graphs Rules. In: Schärfe, H., Hitzler, P., Øhrstrøm, P. (eds) Conceptual Structures: Inspiration and Application. ICCS 2006. Lecture Notes in Computer Science(), vol 4068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787181_8
Download citation
DOI: https://doi.org/10.1007/11787181_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35893-0
Online ISBN: 978-3-540-35902-9
eBook Packages: Computer ScienceComputer Science (R0)