{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:39:42Z","timestamp":1725525582257},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926863"},{"type":"electronic","value":"9783540926870"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92687-0_11","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T09:25:38Z","timestamp":1234257938000},"page":"152-163","source":"Crossref","is-referenced-by-count":2,"title":["Positive Fork Graph Calculus"],"prefix":"10.1007","author":[{"given":"Renata","family":"de Freitas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheila R. M.","family":"Veloso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo A. S.","family":"Veloso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petrucio","family":"Viana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"372","volume-title":"9th IEEE Symp. Logic in Computer Science","author":"C. Brown","year":"1994","unstructured":"Brown, C., Hutton, G.: Categories, allegories and circuit design. In: 9th IEEE Symp. Logic in Computer Science, pp. 372\u2013381. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Brown, C., Jeffrey, A.: Allegories of circuits. In: Proc. Logical Foundations of Computer Science, St. Petersburg, pp. 56\u201368 (1994)","DOI":"10.1007\/3-540-58140-5_7"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-60117-1_12","volume-title":"Mathematics of Program Construction","author":"S. Curtis","year":"1995","unstructured":"Curtis, S., Lowe, G.: A graphical calculus. In: M\u00f6ller, B. (ed.) MPC 1995. LNCS, vol.\u00a0947, pp. 214\u2013231. Springer, Heidelberg (1995)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0167-6423(95)00025-9","volume":"26","author":"S. Curtis","year":"1996","unstructured":"Curtis, S., Lowe, G.: Proofs with graphs. Sci. Comput. Program.\u00a026, 197\u2013216 (1996)","journal-title":"Sci. Comput. Program."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"de Freitas, R.P., Veloso, P.A.S., Veloso, S.R.M., Viana, P.: Reasoning with graphs. ENTCS, vol.\u00a0165, pp. 201\u2013212 (2006)","DOI":"10.1016\/j.entcs.2006.05.046"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1093\/jigpal\/jzm054","volume":"15","author":"R.P. Freitas de","year":"2006","unstructured":"de Freitas, R.P., Veloso, P.A.S., Veloso, S.R.M., Viana, P.: On positive relational calculi. Logic J. IGPL\u00a015, 577\u2013601 (2006)","journal-title":"Logic J. IGPL"},{"key":"11_CR7","volume-title":"Categories, Allegories","author":"P.J. Freyd","year":"1990","unstructured":"Freyd, P.J., Scedrov, A.: Categories, Allegories. North-Holland, Amsterdam (1990)"},{"key":"11_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/4899","volume-title":"Fork Algebras in Algebra, Logic and Computer Science","author":"M. Frias","year":"2002","unstructured":"Frias, M.: Fork Algebras in Algebra, Logic and Computer Science. World Scientific, Singapore (2002)"},{"key":"11_CR9","volume-title":"Relation Algebras by Games","author":"R. Hirsch","year":"2002","unstructured":"Hirsch, R., Hodkinson, I.: Relation Algebras by Games. Elsevier, Amsterdam (2002)"},{"key":"11_CR10","unstructured":"Hutton, G.: A relational derivation of a functional program. In: Lecture Notes of the STOP Summer School on Constructive Algorithms, Ameland (1992)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-62559-3_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"W. Kahl","year":"1997","unstructured":"Kahl, W.: Algebraic graph derivations for graphical calculi. In: D\u2019Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) WG 1996. LNCS, vol.\u00a01197, pp. 224\u2013238. Springer, Heidelberg (1997)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1093\/jigpal\/6.2.259","volume":"6","author":"W. Kahl","year":"1998","unstructured":"Kahl, W.: Relational treatment of term graphs with bound variables. Logic J. IGPL\u00a06, 259\u2013303 (1998)","journal-title":"Logic J. IGPL"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0020-0255(99)00018-3","volume":"119","author":"W. Kahl","year":"1999","unstructured":"Kahl, W.: Relational matching for graphical calculi of relations. Inform. Sciences\u00a0119, 253\u2013273 (1999)","journal-title":"Inform. Sciences"},{"key":"11_CR14","volume-title":"Relation Algebras","author":"R.D. Maddux","year":"2006","unstructured":"Maddux, R.D.: Relation Algebras. Elsevier, Amsterdam (2006)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00082-8","volume":"160","author":"R.D. Maddux","year":"1996","unstructured":"Maddux, R.D.: Relation-algebraic semantics. Theor. Comput. Sci.\u00a0160, 1\u201385 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR16","first-page":"103","volume":"21","author":"S. Mikul\u00e1sz","year":"1992","unstructured":"Mikul\u00e1sz, S., Sain, I., Simon, A.: Complexity of the equational theory of relation algebras with projection elements. Bull. Sect. Logic Univ. L\u00f3d\u017a\u00a021, 103\u2013111 (1992)","journal-title":"Bull. Sect. Logic Univ. L\u00f3d\u017a"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92687-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T23:09:21Z","timestamp":1558134561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92687-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926863","9783540926870"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92687-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}