Representation and Execution of a Graph Grammar in Prolog | SpringerLink
Skip to main content
Springer Nature Link
Log in

Representation and Execution of a Graph Grammar in Prolog

  • Conference paper
Logic Programming (ICLP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4670))

Included in the following conference series:

  • 548 Accesses

Abstract

Structured diagrams - e.g., ER diagrams - consist of finite types of symbols interconnected according to well-defined rules. Graph grammars [CEEe95, Hab92] are a well-known formalism used to specify the syntax of structured diagrams. Many graph grammar formalisms have been defined, which differ mainly in their graph rewrite mechanism. Graph grammars are well understood in algebraic framework; but there is little work in linking them to logic programming [CMR + 91, CMR + 91, CR93, Sch93].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.): 5th Int. Work. Graph Grammars and Their Application to Computer Science. LNCS, vol. 1073. Springer, Heidelberg (1996)

    Google Scholar 

  2. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Lowe, M.: Graph grammars and logic programming. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars and Their Application to Computer Science. LNCS, vol. 532, pp. 221–237. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  3. Corradini, A., Rossi, F.: On the expressive power of hyperedge-replacement jungle rewriting for term rewriting systems and logic programming. Theoretical Computer Science, 109 (1993)

    Google Scholar 

  4. Habel, A.: Hyperedge Replacements: Grammars and Languages. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  5. Schurr, A.: Logic-based structure rewriting systems. In: Dagstuhl Seminar on Graph Transformations in Computer Science, pp. 341–357 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tata Research Development and Design Centre (TRDDC),  

    Girish Keshav Palshikar

Authors
  1. Girish Keshav Palshikar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Véronica Dahl Ilkka Niemelä

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Palshikar, G.K. (2007). Representation and Execution of a Graph Grammar in Prolog. In: Dahl, V., Niemelä, I. (eds) Logic Programming. ICLP 2007. Lecture Notes in Computer Science, vol 4670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74610-2_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74610-2_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74608-9

  • Online ISBN: 978-3-540-74610-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation