{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:35:38Z","timestamp":1742391338950},"reference-count":33,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0304-3975(01)00295-x","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"521-560","source":"Crossref","is-referenced-by-count":15,"title":["Operational and abstract semantics of the query language G-Log"],"prefix":"10.1016","volume":"275","author":[{"given":"Agostino","family":"Cortesi","sequence":"first","affiliation":[]},{"given":"Agostino","family":"Dovier","sequence":"additional","affiliation":[]},{"given":"Elisa","family":"Quintarelli","sequence":"additional","affiliation":[]},{"given":"Letizia","family":"Tanca","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00295-X_BIB1","unstructured":"A. Abiteboul, P. Kanellakis, Object identity as a query language primitive, Proc. 1989 SIGMOD Internat. Conf. on the Management of Data, Sigmod Record, Vol. 19, June 1990."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB2","unstructured":"P. Aczel, Non-well-founded Sets. Lecture Notes, Vol. 14 Center for the Study of Language and Information, Stanford, 1988."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB3","doi-asserted-by":"crossref","unstructured":"G. Arocena, A. Mendelzon, WebOQL: restructuring documents, databases, and webs. In Proc. 14th Internat. Conf. on Data Engineering, IEEE Computer Society Press, Silver Spring, MD, 1998, pp. 24\u201333.","DOI":"10.1109\/ICDE.1998.655754"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB4","doi-asserted-by":"crossref","unstructured":"P. Buneman, S.B. Davidson, G.G. Hillebrand, D. Suciu, A query language and optimization techniques for unstructured data, in: H.V. Jagadish, I.S. Mumick (Eds.), Proc. 1996 ACM SIGMOD Internat. Conf. on Management of Data, Montreal, Canada, pp. 505\u2013516, June 1996, ACM Press 1996, SIGMOD Record 25 (2).","DOI":"10.1145\/233269.233368"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB5","doi-asserted-by":"crossref","unstructured":"S. Ceri, S. Comai, E. Damiani, P. Fraternali, S. Paraboschi, L. Tanca, XML-GL: a graphical language for querying and restructuring XML documents. Proc. 8th Internat. World Wide Web Conference WWW8\u201d, Toronto, Canada, May 1999.","DOI":"10.1016\/S1389-1286(99)00014-6"},{"issue":"1","key":"10.1016\/S0304-3975(01)00295-X_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/320434.320440","article-title":"The entity-relationship model: toward a unified view of data","volume":"1","author":"Chen","year":"1976","journal-title":"ACM Trans. DB Systems"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB7","unstructured":"S. Comai, Graphical query languages for semi-structured information, Ph.D. Thesis, Politecnico di Milano, 1999."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB8","doi-asserted-by":"crossref","unstructured":"S. Comai, E. Damiani, R. Posenato, L. Tanca, A Schema-based approach to modeling and querying WWW data, Proc. Internat. Conf. on Flexible Query Answering Systems, FQAS\u201998, Roskilde, Denmark, May 13\u201315, 1998.","DOI":"10.1007\/BFb0055995"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB9","doi-asserted-by":"crossref","unstructured":"M.P. Consens, A.O. Mendelzon, Graphlog: a visual formalism for real life recursion, Proc. 9th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Nashville, Tennessee, April 2\u20134, 1990.","DOI":"10.1145\/298514.298591"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB10","doi-asserted-by":"crossref","unstructured":"P. Cousot, R. Cousot, Abstract interpretation: a unified framework for static analysis of programs by construction of approximation of fixpoints. Proc. 4th ACM POPL, 1977, pp. 238\u2013252.","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB11","unstructured":"E. Damiani, L. Tanca, Semantic approches to structuring and querying web sites. Proc. 7th IFIP Work. Conf. on Database Semantics (DS-97), 1997."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB12","doi-asserted-by":"crossref","unstructured":"E. Damiani, L. Tanca, Blind queries to XML data. Proc. SEBD 2000, June 2000, pp. 79\u201393.","DOI":"10.1007\/3-540-44469-6_32"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB13","unstructured":"A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Suciu, XML-QL: a query language for XML. In Proc. QL\u201998\u2014The Query Languages Workshop, December 1998."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB14","doi-asserted-by":"crossref","unstructured":"A. Dovier, E. Quintarelli, Model-checking based data retrieval, in: Proc. of DBPL \u201901, 8th Int. Workshop on Databases and Programming Languages, Marino, Rome, September 8\u201310, 2001.","DOI":"10.1007\/3-540-46093-4_4"},{"issue":"3","key":"10.1016\/S0304-3975(01)00295-X_BIB15","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/262762.262763","article-title":"A query language for a web-site management system","volume":"26","author":"Fernandez","year":"1997","journal-title":"SIGMOD Record"},{"issue":"2","key":"10.1016\/S0304-3975(01)00295-X_BIB16","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/234528.234742","article-title":"A unifying view on abstract domain design","volume":"28","author":"Fil\u00e8","year":"1996","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB17","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB18","unstructured":"R. Goldman, J. Widom, Dataguides: enabling querying formulation and optimization in semi-structured databases, VLDB\u201997, Proc. 23rd Internat. Conf. on Very Large Data Bases, 1997, pp. 436\u2013445."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB19","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/69.298174","article-title":"A graph-oriented object database model","volume":"6","author":"Gyssens","year":"1994","journal-title":"IEEE Trans. Knowledge Data Engng"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB20","first-page":"186","article-title":"Graph Transformation and Visual Modeling Techniques","volume":"71","author":"Heckel","year":"2000","journal-title":"Bull. EATCS"},{"issue":"1","key":"10.1016\/S0304-3975(01)00295-X_BIB21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS expressions, finite state processes, and three problems of equivalence","volume":"86","author":"Kanellakis","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB22","doi-asserted-by":"crossref","unstructured":"A. Lisitsa, V. Sazanov, Bounded hyperset theory and web-like data bases. Research Report, 97-21, DIMACS, 1997.","DOI":"10.1007\/3-540-63385-5_42"},{"issue":"3","key":"10.1016\/S0304-3975(01)00295-X_BIB23","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/262762.262770","article-title":"Lore","volume":"23","author":"McHugh","year":"1997","journal-title":"SIGMOD Record"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB24","doi-asserted-by":"crossref","unstructured":"A. Mendelzon, G. Mihaila, T. Milo, Querying the world wide web, Proc. 4th Conf. on Parallel and Distributed Information Systems, Miami Beach, Florida, USA, December 1996.","DOI":"10.1109\/PDIS.1996.568671"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB25","unstructured":"R. Milner, An algebraic definition of simulation between programs, Second Internat. Joint Conf. on Artificial Intelligence, London, 1971, pp. 481\u2013489."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB26","series-title":"A Calculus of Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB27","doi-asserted-by":"crossref","unstructured":"R. Milner, Operational and algebraic semantics of concurrent processes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier Science, Amsterdam, 1990 (Chapter 19).","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB28","doi-asserted-by":"crossref","unstructured":"B. Oliboni, L. Tanca, Querying XML specified WWW sites: links and recursion in XML-GL, Proc. 6th Internat. Conf. on Rules and Objects in Databases, London, July 2000, pp. 1167\u20131181.","DOI":"10.1007\/3-540-44957-4_78"},{"key":"10.1016\/S0304-3975(01)00295-X_BIB29","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/69.390249","article-title":"G-Log","volume":"7","author":"Paredaens","year":"1995","journal-title":"IEEE Trans. Knowledge and Data Engng."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB30","unstructured":"D. Park, Concurrency and automata on infinite sequences. In Theoretical Computer Science, Number 104 of Lecture Notes in Computer Science. Springer Verlag, 1980."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB31","unstructured":"P. Peelman, G-Log: a deductive language for a graph-based data model, Ph.D. Thesis, Antwerpen University, 1993."},{"issue":"6","key":"10.1016\/S0304-3975(01)00295-X_BIB32","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinements algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00295-X_BIB33","unstructured":"J. van Benthem, Modal correspondence theory, Ph.D. Dissertation, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzoek van Exacte Wetenschappen, 1978, pp. 1\u2013148."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100295X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750100295X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T07:56:15Z","timestamp":1578470175000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750100295X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S030439750100295X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00295-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}