{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:01Z","timestamp":1725663901856},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539827"},{"type":"electronic","value":"9783540465638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53982-4_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:20:23Z","timestamp":1330208423000},"page":"275-295","source":"Crossref","is-referenced-by-count":6,"title":["Logic programming as hypergraph Rewriting"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Parisi-Presicce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"16_CR1","unstructured":"Asperti, A., Martini, S., Projections instead of variables, A category theoretic interpretation of logic programs, Proc. 6th Int. Conf. on Logic Programming, Lisboa, Portugal, 1989."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Claus, V., Ehrig, H., Rozenberg, G., (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":"16_CR3","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., L\u00f6we, M., Logic Programming and Graph Grammars, to appear in [EKR91]."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Aspects of concurrency in graph grammars, in [ENR83], pp. 58\u201381.","DOI":"10.1007\/BFb0000099"},{"key":"16_CR5","unstructured":"Ehrig, H., Tutorial introduction to the algebraic approach of graph-grammars, in [ENRR87], pp. 3\u201314."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce, Parallelism and Concurrency in High-Level Replacement Systems, Technical Report, Technische Universit\u00e4t Berlin, September 1990.","DOI":"10.1017\/S0960129500001353"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Kreowski, H.-J., Rozenberg, G., (Eds.) Proceedings of the 4 th International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS, 1991, to appear.","DOI":"10.1007\/BFb0017372"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Nagl, M., Rozenberg, G., (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":"16_CR9","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A., (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":"16_CR10","unstructured":"Goguen, J.A., What is Unification? A Categorical View of Substitution, Equation and Solution, SRI Research Report SRI-CSL-88-2R2, SRI International, Menlo Park, California, 1988."},{"key":"16_CR11","unstructured":"Habel, A., Hyperedge Replacement: Grammars and Languages, Ph.D. Thesis, University of Bremen, 1989."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Habel, A., Kreowski, H.-J., May we introduce to you: hyperedge replacement, in [ENRR87], pp. 15\u201326.","DOI":"10.1007\/3-540-18771-5_41"},{"key":"16_CR13","first-page":"92","volume":"332","author":"A. Habel","year":"1988","unstructured":"Habel, A., Kreowski, H-J., Plump, D., Jungle evaluation, in Proc. Fifth Workshop od Specification of Abstract Data Types, LNCS 332, 1988, pp. 92\u2013112.","journal-title":"LNCS"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"J.R. Kennaway, Graph rewriting in some categories of partial morphisms, in [EKR91].","DOI":"10.1007\/BFb0017408"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Kreowski, H.-J., Is parallelism already concurrency? Part 1: Derivations in graph grammars, in [ENRR87], pp. 343\u2013360.","DOI":"10.1007\/3-540-18771-5_63"},{"key":"16_CR16","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":"16_CR17","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W., Foundations of Logic Programming, Springer Verlag, 1984, (Second Edition 1987).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"16_CR18","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":"Mac Lane, S., Categories for the Working Mathematician, Springer Verlag, New York, 1971."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Parisi-Presicce, F., Ehrig, H., Montanari, U., Graph Rewriting with Unification and Composition, in [ENRR87], p. 496\u2013514.","DOI":"10.1007\/3-540-18771-5_72"},{"key":"16_CR20","unstructured":"Rydeheard, D.E., Burstall, R.M., The Unification of Terms: A Category-Theoretic Algorithm, Internal Report UMCS-85-8-1, Dept. Comp. Sci., University of Manchester, August 1985."},{"key":"16_CR21","volume-title":"Proc. META88","author":"F. Rossi","year":"1988","unstructured":"Rossi, F., Montanari, U., Hypergraph Grammars ad Network of Constraints versus Logic Programming and Metaprogramming, in Proc. META88, MIT Press, Bristol, June 1988."},{"key":"16_CR22","unstructured":"Rossi, F., Montanari, U., Constraint Relaxation as Higher Order Logic Programming, to appear in Proc. META90, Leuven, April 1990. Also Proc. GULP '88, in italian."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53982-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:51:47Z","timestamp":1605646307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53982-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539827","9783540465638"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-53982-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}