Abstract
Graph grammars can easily be considered as models for rule-based systems where solving state-space problems essentially requires searching. Since many AI problems are naturally graphical, graph grammars could narrow the usual gap between a problem and its formal specification.
In order to be able to solve such problems in practice one must reduce the effort of search. Here, for graph grammar specifications, the idea of precomputing its rules allows to prune the corresponding search-trees safely by explicitly pointing to those subtrees which are contained in others. Moreover, for some rules it becomes possible to use the information of a rule's former for to predict its later non-applicability, thus avoiding some redundant, expensive applicability tests. The example of solving a domino game based on breadth-first search demonstrates that indeed some remarkable reductions can be obtained.
This work is partly supported by the projects “Computing by Graph Transformations (GraGra)” and “Kategorielle Methoden in Topologie und Informatik (KAMITI)”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Ehrig: “Introduction to the Algebraic Theory of Graph Grammars” — LNCS 73, Springer Verlag, Berlin, pp. 1–69, 1979
H. Ehrig, A. Habel: “Graph Grammars with Application Conditions” — In ”The Book of L”, Springer Verlag, Berlin, pp. 87–100, 1985
H. Ehrig, A. Habel, B.K. Rosen: “Concurrent Transformations of Relational Structures” — Fundamenta Informatica, Vol IX (1), 1986
M. Korff: “Optimizations of Production Systems based on Algebraic Graph Transformations” — Technical Report 90/8, TU Berlin, 1990
H.-J. Kreowski: “Anwendungen der algebraischen Graphentheorie auf Konsistenz und Synchronisation in Datenbanksystemen” — Technical Report 78/15, TU Berlin, 1978
H.-J. Kreowski and A. Habel: “Is Parallelism already Concurrency? Part II: Non-Sequential Processes in Graph Grammars” — LNCS 153, Springer Verlag, Berlin, pp. 360–380, 1987
M. Löwe: “Implementing Algebraic Specifications by Graph Transformation Systems” — Technical Report 89/26 of FB 20 at the TU Berlin, 1989
D. Moldovan and F. Parisi-Presicce: “Parallelism Analysis in Rule-Based Systems Using Graph Grammars” — LNCS 291, Springer Verlag, Berlin, pp. 427–439, 1987
P. Jackson, Jr.: “Introduction to artificial intelligence” — Mason & Lipscomb Publishers, Inc., London, 1974
N. Nilson: “Principles of Artificial Intelligence” — Springer Verlag, Berlin, 1982
E. Rich: “Artificial Intelligence” — New York: McGraw-Hill, 1986
Y. Shirai, J. Tsujii: “Artificial Intelligence: Concepts, Techniques and Applications” — John Wiley & Sons, 1984
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korff, M. (1991). Application of graph grammars to rule-based systems. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017409
Download citation
DOI: https://doi.org/10.1007/BFb0017409
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54478-4
Online ISBN: 978-3-540-38395-6
eBook Packages: Springer Book Archive