Using Graph Mining Approach to Automatic Reasoning in Design Support Systems

  • Barbara Strug
Conference paper
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 95)


In this paper an improved method of using frequent patterns to gain knowledge about the quality of new designs in design systems is presented. The hypergraph-based representation is used as an underlying structure for design representation. The application of this method to automatic evaluation of designs is also presented. Two different methods of reducing size of the set of frequent patterns are described. Experimental results are also presented.


Frequent Pattern Automatic Reasoning Graph Grammar Frequent Pattern Mining Frequent Subgraph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. 1993 ACM-SIGMOD Int. Conf. Manag. of Data SIGMOD, Washington, vol. 93, pp. 207–216 (1993)Google Scholar
  2. 2.
    Borkowski, A., Grabska, E., Nikodem, P., Strug, B.: Searching for Innovative Structural Layouts by Means of Graph Grammars and Esvolutionary Optimization. In: Proc. 2nd Int. Structural Eng. And Constr. Conf., Rome, pp. 475–480 (2003)Google Scholar
  3. 3.
    Clarke, E.M., Emerson, E.A., Sistla, P.A.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. on Progr. Lang. and Sys. 8, 244–263 (1986)CrossRefzbMATHGoogle Scholar
  4. 4.
    Csuhaj-Varj, E.: Grammar systems: A short survey. In: Proceedings of Grammar Systems Week 2004, Budapest, Hungary, pp. 141–157 (2004)Google Scholar
  5. 5.
    Csuhaj-Varj, E., Vaszil, G.: On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms. Theor. Comp. Sc. 255(1-2), 511–538 (2001)CrossRefGoogle Scholar
  6. 6.
    Csuhaj-Varj, E., Dassow, J., Kelemen, J., Paun, G.: Grammar systems. A grammatical approach to distribution and cooperation. Topics in Computer Mathematics, vol. 8. Gordon and Breach Science Publishers, Yverdon (1994)Google Scholar
  7. 7.
    Csuhaj-Varj, E., Dassow, J., Paun, G.: Dynamically controlled cooperating/distributed grammar systems. Information Sciences 69(1-2), 1–25 (1993)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Dassow, J., Paun, G., Rozenberg, G.: Grammar systems. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 2(4), pp. 155–213. Springer, Heidelberg (1997)Google Scholar
  9. 9.
    Grabska, E.: Theoretical Concepts of Graphical Modelling. Part one: Realization of CP-graphs. MG&V 2(1), 3–38 (1993)Google Scholar
  10. 10.
    Grabska, E.: Theoretical Concepts of Graphical Modelling. Part two: CP-graph Grammars and Languages. MG&V 2(2), 149–178 (1993)Google Scholar
  11. 11.
    Grabska, E.: Graphs and designing. In: Ehrig, H., Schneider, H.-J. (eds.) Graph Transformations in Computer Science 1993. LNCS, vol. 776. Springer, Heidelberg (1994)Google Scholar
  12. 12.
    Grabska, E., Palacz, W.: Hierarchical graphs in creative design. MG&V 9(1/2), 115–123 (2000)Google Scholar
  13. 13.
    Grabska, E., Nikodem, P., Strug, B.: Evolutionary Methods and Graph Grammars in Design and Optimization of Skeletal Structures Weimar. In: Proc. of 11th ICE 2004, Weimar, pp. 145–155 (2004)Google Scholar
  14. 14.
    Habel, A., Kreowski, H.J.: Some structural aspects of hypergraph languages generated by hyperedge replacement. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 207–219. Springer, Heidelberg (1987)CrossRefGoogle Scholar
  15. 15.
    Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-pattern Tree Approach. Data Min. and Know. Disc. 8(1), 53–87 (2004)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Hoffman, C.M.: Geometric and Solid Modeling: An Introduction. Morgan Kaufmann, San Francisco (1989)Google Scholar
  17. 17.
    Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 87–92. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  18. 18.
    Kelemen, J.: Syntactical models of cooperating/distributed problem solving. J. of Exp. and Theor. AI 3(1), 1–10 (1991)CrossRefGoogle Scholar
  19. 19.
    Mantyla, M.: An Introduction To Solid Modeling. Computer Science Press, Rockville (1988)Google Scholar
  20. 20.
    Martin, R.R., Stephenson, P.C.: Sweeping of Three-dimensional Objects. CAD 22(4), 223–234 (1990)zbMATHGoogle Scholar
  21. 21.
    Martin-Vide, C., Mitrana, V.: Cooperation in contextual grammars. In: Kelemenovi, A. (ed.) Proc. of the MFCS 1998 Satellite Workshop on Grammar Systems, pp. 289–302. Silesian University, Opava (1998)Google Scholar
  22. 22.
    Nikodem, P., Strug, B.: Graph Transformations in Evolutionary Design. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 456–461. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  23. 23.
    Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformations. Fundations, vol. 1. World Scientific, London (1997)CrossRefzbMATHGoogle Scholar
  24. 24.
    Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformations. Applications. Languages and Tools, vol. 2. World Scientific, London (1999)Google Scholar
  25. 25.
    Simeoni, M., Staniszkis, M.: Cooperating graph grammar systems. In: Paun, G., Salomaa, A. (eds.) Grammatical Models of Multi-Agent Systems, pp. 193–217. Gordon and Breach, Amsterdam (1999)Google Scholar
  26. 26.
    Strug, B., Ślusarczyk, G.: Reasoning about designs through frequent patterns mining. Adv. Eng. Inf. 23, 361–369 (2009)CrossRefGoogle Scholar
  27. 27.
    Strug, B., Ślusarczyk, G.: Frequent Pattern Mining in a Design Supporting System. Key Eng. Mat. 450, 1–4 (2011)CrossRefGoogle Scholar
  28. 28.
    Strug, J., Deniziak, S., Sapiecha, K.: Validation of Reactive Embedded Systems against Temporal Requirements. In: Proc. of ECBS 2004, pp. 152–160 (2004)Google Scholar
  29. 29.
    Tomanek M.: Searching for graph patterns and applications. MSc thesis, Jagiellonian University (2009) (in Polish)Google Scholar
  30. 30.
    Yan, X., Yu, P.S., Han, J.: Graph Indexing: A Frequent Structure-based Approach. In: Proc. of 2004 Int. Conf. on Manag. of Data SIGMOD 2004, pp. 335–346 (2004)Google Scholar
  31. 31.
    Yan, X., Yu, P.S., Han, J.: Substructure Similarity Search in Graph Databases. In: Proc. of 2005 Int. Conf. on Manag. of Data SIGMON 2005, pp. 766–777 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Barbara Strug
    • 1
  1. 1.Faculty of Physics, Astronomy and Applied Computer ScienceJagiellonian UniversityCracowPoland

Personalised recommendations