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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Baget, J. F., & Salvat, É. (2006). Rules dependencies in backward chaining of conceptual graphs rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4068 LNAI, pp. 102–116). Springer Verlag. https://doi.org/10.1007/11787181_8
Mendeley helps you to discover research relevant for your work.