Abstract
This paper presents a new logic based framework for the formal treatment of graph rewriting systems and graph languages as special cases of rewriting systems and languages for arbitrary relational data structures. Considering its expressive power, the new formalism is intended to contain almost all forms of nonparallel algebraic as well as algorithmic graph grammar approaches as special cases. Furthermore, our formalism tries to close the gap between the operation oriented manipulation of data structures by means of graph rewrite rules and the declaration oriented description of data structures by means of logic based languages.
Nevertheless, the main motivation for the development of yet another structure rewriting approach was not to combine the advantages of graph grammar based and logic based languages but to provide us with a solid fundament for a formal definition of our own graph grammar based language PROGRES, which is a kind of visual data definition and data manipulation language. This language has been designed for specifying and rapid prototyping of complex data structures and contains many constructs which enhance its expressiveness considerably (like definition of derived properties, consistency constraints, rewrite rules with complex application conditions and embedding rules) but which were not definable within the framework of a single already existing graph grammar approach.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ausiello G., Atzeni P. (eds.): Proc. Int. Conf. on Database Theory, LNCS 243, Springer Press
Bry F., Manthey R., Martens B.: Integrity Verification in Knowledge Bases, in: [Vor91], 1142–139
Claus V., Ehrig H., Rozenberg G.: Proc. Int. Workshop on Graph-Grammars and Their Application to Computer Science and Biology, LNCS 73, Springer Press (1979)
Courcelle B.: Graphs as Relational Structures: An Algebraic and Logical Approach, in: [EKR 91], 238–252
Ehrig H., Habel A.: Graph Grammars with Application Condition, in: [RS 86], 87–100
Ehrig H., Habel A., Kreowski H.-J., Parisi-Presicce F.: From Graph Grammars to High-level Replacement Systems, in: [EKR 91], 269–291
Ehrig H.: Introduction to the Algebraic Theory of Graph Grammars (a Survey), in: [CER 79], 1–69
Ehrig H., Kreowski H.-J., Rozenberg G.: Proc. 4th Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 532, Springer Press (1991)
Gallaire H.: Logic and Data Bases, Plenum Press (1978)
Göttler H.: Graphgrammatiken in der Softwaretechnik, IFB 178, Springer Press (1988)
Van Hentenrynck P.: Constraint Satisfaction in Logic Programming, MIT Press (1989)
Kreowski H.-J, Rozenberg G.: On Structured Graph Grammars: Part I and II, Technical Report 3/88, University of Bremen, FB Mathematik/Informatik (1988)
Kiesel N., Schürr A., Westfechtel B.: GRAS, a Graph-Oriented Database System for (Software) Engineering Applications, in: [LRJ93], 272–286
Löwe M.: Algebraic Approach to Graph Transformation Based on Single Pushout Derivations, TR No. 90/5, TU Berlin (1990)
Lee H.-Y., Reid Th.F., Jarzabek St. (eds.): CASE '93 Proc. 6th Int. Workshop on Computer-Aided Software Engineering, IEEE Computer Society Press (1993)
Mylopoulos J., Borgida A., Jarke M., Koubarkis M.: Telos: a Language for Representing Knowledge about Information Systems, ACM Transactions on Information Systems, Vol. 8, No. 4, acm Press (1990), 325–362
Minker J.: Perspectives in Deductive Databases, in: The Journal of Logic Programming, Elsevier Science Publ. (1988), 33–60
Maggiolo-Schettini A., Winkowski J.: Programmed Derivations of Relational Structures, in: [EKR91], 582–598
Nagl M.: Graph-Grammatiken, Vieweg Press (1979)
Nagl M.: A Tutorial and Bibliographical Survey on Graph Grammars, in: [CER 79], 70–126
Nagl M.: Graph Technology Applied to a Software Project, in: [RS 86], 303–322
Naqvi Sh.A.: Some Extensions to the Closed World Assumption in Databases, in: [AA 86], 341–348
Naqvi Sh.A.: Negation as Failure for First-Order Queries, in: Proc. 5th ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, acm Press (1986), 114–122
Nagl M., Schürr A.: A Specification Environment for Graph Grammars, in: [EKR 91], 599–609
Naqvi Sh.A., Tsur Sh.: Data and Knowledge Bases, IEEE Computer Society Press (1989)
Rozenberg G., Salomaa A.: The Book of L, Springer Press (1986)
Rybinski H.: On First-Order-Logic Databases, in: ACM Transaction on Database Systems, Vol. 12, No.3, acm Press (1987), 325–349
Schmidt G., Berghammer R.: Proc. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG '91), LNCS 570, Springer Press (1991)
Schürr A.: PROGRES: A VHL-Language Based on Graph Grammars, in: [EKR 91], 641–659
Schürr A.: Operational Specifications with Programmed Graph Rewriting Systems: Formal Definitions, Applications, and Tools (in German), Deutscher Universitätsverlag (1991)
Schürr A., Zündorf A.: Non-Deterministic Control Structures for Graph Rewriting Systems, in: [SB 91], 48–62
Thaise A. (ed.): From Standard Logic to Logic Programming, John Wiley & Sons Ltd. (1989)
Voronkov A. (ed.): Logic Programming, LNCS 592, Springer Press (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schürr, A. (1994). Logic based structure rewriting systems. In: Schneider, H.J., Ehrig, H. (eds) Graph Transformations in Computer Science. Lecture Notes in Computer Science, vol 776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57787-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-57787-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57787-4
Online ISBN: 978-3-540-48333-5
eBook Packages: Springer Book Archive