{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:43Z","timestamp":1725455923611},"publisher-location":"Berlin\/Heidelberg","reference-count":25,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354054478X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017392","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:32:12Z","timestamp":1132644732000},"page":"221-237","source":"Crossref","is-referenced-by-count":7,"title":["Graph grammars and logic programming"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Corradini","sequence":"first","affiliation":[]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[]},{"given":"Francesca","family":"Rossi","sequence":"additional","affiliation":[]},{"given":"Hartmut","family":"Ehrig","sequence":"additional","affiliation":[]},{"given":"Michael","family":"L\u00f6we","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"A. Asperti, S. Martini, Projections instead of variables, A category theoretic interpretation of logic programs, Proc. 6th Int. Conf. on Logic Programming, MIT Press, 1989, pp. 337\u2013352."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon, B. Courcelle, Graph Expressions and Graph Rewritings, Mathematical System Theory 20, 1987, pp. 83\u2013127.","journal-title":"Mathematical System Theory"},{"key":"20_CR3","first-page":"141","volume":"259","author":"H.P. Barendregt","year":"1987","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep, Term graph reduction, in Proc. PARLE, LNCS 259, 1987, pp. 141\u2013158.","journal-title":"LNCS"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"V. Claus, H. Ehrig, G. Rozenberg, (Eds.) Proceedings of the 1 st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, LNCS 73, 1979.","DOI":"10.1007\/BFb0025713"},{"key":"20_CR5","unstructured":"B. Courcelle, On using context-free graph grammars for analyzing recursive definitions, in Programming of Future Generation Computers II, K. Fuchi, L. Kott (Eds.), Elsevier-North-Holland, 1988, pp. 83\u2013122."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"H. Ehrig, Aspects of concurrency in graph grammars, in [ENR83], pp. 58\u201381.","DOI":"10.1007\/BFb0000099"},{"key":"20_CR7","unstructured":"H. Ehrig, Tutorial introduction to the algebraic approach of graph-grammars, in [ENRR87] pp. 3\u201314."},{"key":"20_CR8","unstructured":"H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce, High-Level Replacement Systems, in [EKR91]."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.-J. Kreowski, G. Rozenberg, (Eds.) Proceedings of the 4 th International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS, 1991, this volume.","DOI":"10.1007\/BFb0017372"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, G. Rozenberg, (Eds.) Proceedings of the 2 nd International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 153, 1983.","DOI":"10.1007\/BFb0000094"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld, (Eds.) Proceedings of the 3 rd International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 291, 1987.","DOI":"10.1007\/3-540-18771-5"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Pfender, H.J. Schneider, Graph-grammars: an algebraic approach, Proc, IEEE Conf. on Automata and Switching Theory, 1973, pp. 167\u2013180.","DOI":"10.1109\/SWAT.1973.11"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative Modeling of the Operational Behaviour of Logic Languages, Theoretical Computer Science, 69(3), 1989, pp. 289\u2013318.","journal-title":"Theoretical Computer Science"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"M. Falaschi, G. Levi, C. Palamidessi, A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses, in Information and Control, 60(1\u20133), Academic Press, 1984.","DOI":"10.1016\/S0019-9958(84)80021-2"},{"key":"20_CR15","unstructured":"J.A. Goguen, What is Unification? A Categorical View of Substitution, Equation and Solution, in M. Nivat and H. A\u00eft-Kaci (Eds.), Resolution of Equations in Algebraic Structures, Academic Press, 1989."},{"key":"20_CR16","unstructured":"A. Habel, Hyperedge Replacement: Grammars and Languages, Ph.D. Thesis, University of Bremen, 1989."},{"key":"20_CR17","first-page":"92","volume":"332","author":"A. Habel","year":"1988","unstructured":"A. Habel, H-J. Kreowski, D. Plump, Jungle evaluation, in Proc. Fifth Workshop on Specification of Abstract Data Types, LNCS 332, 1988, pp. 92\u2013112.","journal-title":"LNCS"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(87)90079-X","volume":"52","author":"J.R. Kennaway","year":"1987","unstructured":"J.R. Kennaway, On \u2018On Graph Rewritings', Theoretical Computer Science, 52, 1987, pp. 37\u201358.","journal-title":"Theoretical Computer Science"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"J.R. Kennaway, Graph rewriting in some categories of partial morphisms, in [EKR91].","DOI":"10.1007\/BFb0017408"},{"key":"20_CR20","first-page":"1649","volume-title":"Proc. 5th Int. Conf. Symp. on Logic Programming","author":"G. Levi","year":"1988","unstructured":"G. Levi, Models, Unfolding Rules and Fixpoint Semantics, in Proc. 5th Int. Conf. Symp. on Logic Programming, Seattle, MIT Press, pp. 1649\u20131665, 1988."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, Springer Verlag, 1984, (Second Edition 1987).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"20_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1971","unstructured":"S. Mac Lane, Categories for the Working Mathematician, Springer Verlag, New York, 1971."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"F. Parisi-Presicce, H. Ehrig and U. Montanari, Graph Rewriting with Unification and Composition, in [ENRR87], pp. 496\u2013514.","DOI":"10.1007\/3-540-18771-5_72"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(84)90021-5","volume":"32","author":"J.C. Raoult","year":"1984","unstructured":"J.C. Raoult, On Graph Rewritings, Theoretical Computer Science, 32, 1984, pp. 1\u201324.","journal-title":"Theoretical Computer Science"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"D.E. Rydeheard, R.M. Burstall, A Categorical Unification Algorithm, Proc. of the Workshop on Category Theory and Computer Programming, LNCS 240, 1985.","DOI":"10.1007\/3-540-17162-2_139"}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017392.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:21Z","timestamp":1607549901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354054478X"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0017392","relation":{},"subject":[]}}