{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:12:33Z","timestamp":1725459153734},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540619949"},{"type":"electronic","value":"9783540495888"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0037422","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:15:55Z","timestamp":1138184155000},"page":"393-400","source":"Crossref","is-referenced-by-count":0,"title":["On the specification of visual languages: Multisets as first-class citizens"],"prefix":"10.1007","author":[{"given":"Massimo","family":"Marchiori","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"30_CR1","unstructured":"A. Ames, D. Nadeau, and J.L. Moreland. The VRML Sourcebook. Wiley & Sons, 1996."},{"key":"30_CR2","unstructured":"A.G. Cohn and J.M. Gooday. Defining the syntax and the semantics of a visual programming language in a spatial logic. In AAAI'94 Workshop on Spatial and Temporal Reasoning, 1994."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"L. Colussi, E. Marchiori, and M. Marchiori. On termination of constraint logic programs. In Int. Conf. on Principles and Practice of Constraint Programming, vol. 976 of LNCS, pp. 431\u2013448. Springer, 1995.","DOI":"10.1007\/3-540-60299-2_26"},{"key":"30_CR4","first-page":"333","volume":"2","author":"C. Crimi","year":"1991","unstructured":"C. Crimi, A. Guercio, G. Nota, G. Pacini, G. Tortora, and M. Tucci. Relation grammars and their application to multi-dimensional languages. JVLC, 2:333\u2013346, 1991.","journal-title":"JVLC"},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S1045-926X(05)80005-9","volume":"2","author":"E.J. Golin","year":"1991","unstructured":"E.J. Golin. Parsing visual languages with picture layout grammars. Journal of Visual Languages and Computing, 2:371\u2013393, 1991.","journal-title":"Journal of Visual Languages and Computing"},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S1045-926X(05)80013-8","volume":"1","author":"E.J. Golin","year":"1990","unstructured":"E.J. Golin and S.P. Reiss. The specification of visual language syntax. Journal of Visual Languages and Computing, 1:141\u2013157, 1990.","journal-title":"Journal of Visual Languages and Computing"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"V. Haarslev. Formal semantics of visual languages using spatial reasoning. In IEEE Symposium on Visual Languages, pages 156\u2013163. IEEE Press, 1995.","DOI":"10.1109\/VL.1995.520804"},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S1045-926X(05)80002-3","volume":"2","author":"R. Helm","year":"1991","unstructured":"R. Helm and K. Marriott. A declarative specification and semantics of visual languages. Journal of Visual Languages and Computing, 2:311\u2013331, 1991.","journal-title":"Journal of Visual Languages and Computing"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming, vol. 353 of LNCS. 1989.","DOI":"10.1007\/BFb0015791"},{"issue":"20","key":"30_CR10","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M.J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19,20:503\u2013581, 1994.","journal-title":"Journal of Logic Programming"},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15:1155\u20131194, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"30_CR12","first-page":"1","volume-title":"Handbook of Logic in Computer Science, vol. 2","author":"J.W. Klop","year":"1992","unstructured":"J.W. Klop. Term rewriting systems. Handbook of Logic in Computer Science, vol. 2, chapter 1, pp. 1\u2013116. Clarendon Press, Oxford, 1992."},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"M. Marchiori. The functional side of logic programming. ACM Int. Conf. on Functional Programming Languages and Computer Architecture, pp. 55\u201365. ACM Press, 1995.","DOI":"10.1145\/224164.224181"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"M. Marchiori. Modularity of completeness revisited. In J. Hsiang, editor, Int. Conf. on Rewriting Techniques and Applications, vol. 914 of LNCS, pp. 2\u201310. Springer, 1995.","DOI":"10.1007\/3-540-59200-8_43"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"M. Marchiori. Proving Existential Termination of Normal Logic Programs. Int. Conf. on Algebraic Methodology and Software Technology, vol. 1101 of LNCS, pp. 375\u2013390, 1996.","DOI":"10.1007\/BFb0014328"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"K. Marriott. Constraint multiset grammars. In IEEE Symposium on Visual Languages, pages 118\u2013125. IEEE Press, 1994.","DOI":"10.1109\/VL.1994.363633"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"M.A. Najork and S.M. Kaplan. Specifying visual languages with conditional set rewrite systems. In IEEE Symposium on Visual Languages. IEEE Press, 1993.","DOI":"10.1109\/VL.1993.269567"},{"issue":"2","key":"30_CR18","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(94)00039-L","volume":"136","author":"E. Ohlebusch","year":"1994","unstructured":"E. Ohlebusch. On the modularity of termination of term rewriting systems. Theoretical Comp. Science, 136(2):333\u2013360, 1994.","journal-title":"Theoretical Comp. Science"},{"issue":"2","key":"30_CR19","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G.E. Peterson","year":"1981","unstructured":"G.E. Peterson and M.E. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28(2):233\u2013264, 1981.","journal-title":"Journal of the ACM"},{"issue":"2","key":"30_CR20","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(94)00276-2","volume":"142","author":"A. Rubio","year":"1995","unstructured":"A. Rubio and R. Nieuwenhuis. A total AC-compatible ordering based on RPO. Theoretical Comp. Science, 142(2):209\u2013227, 1995.","journal-title":"Theoretical Comp. Science"},{"issue":"2","key":"30_CR21","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0304-3975(95)00080-G","volume":"149","author":"M. Schmidt-Schau\u00df","year":"1995","unstructured":"M. Schmidt-Schau\u00df, M. Marchiori, and S.E. Panitz. Modular termination of r-consistent and left-linear term rewriting systems. Theoretical Comp. Science, 149(2):361\u2013374, 1995.","journal-title":"Theoretical Comp. Science"}],"container-title":["Lecture Notes in Computer Science","SOFSEM'96: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T10:33:55Z","timestamp":1555410835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540619949","9783540495888"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0037422","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}