{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:24:13Z","timestamp":1725488653116},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671008"},{"type":"electronic","value":"9783540465645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46564-2_16","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:03:18Z","timestamp":1186826598000},"page":"260-274","source":"Crossref","is-referenced-by-count":1,"title":["Partial Evaluations in a Set-Theoretic Query Language for the WWW"],"prefix":"10.1007","author":[{"given":"Yury P.","family":"Serdyuk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,9]]},"reference":[{"key":"16_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"ICDT\u201997","author":"S. Abiteboul","year":"1997","unstructured":"Abiteboul S. Querying semistructured data, in: ICDT\u201997, LNCS, vol. 1186, Springer, 1997, pp. 1\u201318."},{"key":"16_CR2","unstructured":"Aczel P. Non-Well-Founded Sets. CSLI Lecture Notes, no. 14, 1988."},{"key":"16_CR3","first-page":"1","volume":"11","author":"D. Aliffi","year":"1999","unstructured":"Aliffi D., Dovier A., Rossi G. From set to hyperset unification, The Journal of Functional and Logic Programming, Volume 1999, no. 11, pp. 1\u201348.","journal-title":"From set to hyperset unification, The Journal of Functional and Logic Programming"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bonnet P., Tomasic A. Partial answers for unavailable data sources, in: Proceedings of the Conference on Flexible Query Answering Systems, Roskilde, Denmark, 1998, pp. 43\u201354.","DOI":"10.1007\/BFb0055990"},{"issue":"3","key":"16_CR5","first-page":"10","volume":"22","author":"A. Deutsch","year":"1999","unstructured":"A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Maier, D. Suciu. Querying XML Data, IEEE Data Engineering Bulletin, September 1999, vol. 22, no. 3, pp.10\u201318.","journal-title":"Querying XML Data, IEEE Data Engineering Bulletin"},{"key":"16_CR6","unstructured":"Dovier A., Piazza C., Policriti A. Fast (hyper)set equivalence, in: B. Jayaraman, G. Rossi, eds., DPS\u201999 Workshop on Declarative Programming with Sets, Paris, September 28, 1999."},{"key":"16_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/3-540-63385-5_42","volume-title":"5th Kurt G\u00f6del Colloquium, KGC\u201997","author":"A.P. Lisitsa","year":"1997","unstructured":"Lisitsa A.P., Sazonov V.Yu. Bounded hyperset theory and Web-like data bases, in: 5th Kurt G\u00f6del Colloquium, KGC\u201997, LNCS, vol. 1289, Springer,1997, pp.172\u2013185."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(96)00174-0","volume":"175","author":"A.P. Lisitsa","year":"1997","unstructured":"Lisitsa A.P., Sazonov V.Yu. \u0394-languages for sets and LOGSPACE-computable graph transformers, Theoretical Computer Science, vol. 175, no. 1, 1997, pp. 183\u2013222.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"16_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0304-3975(98)00312-0","volume":"224","author":"A.P. Lisitsa","year":"1999","unstructured":"Lisitsa A.P., Sazonov V.Yu. Linear ordering on graphs, anti-founded sets and polynomial time computability, Theoretical Computer Science, vol. 224, no. 1\u20132, 1999, pp. 173\u2013213.","journal-title":"Theoretical Computer Science"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/0890-5401(91)90051-3","volume":"93","author":"M.W. Mislove","year":"1991","unstructured":"Mislove M.W., Moss L.S., Oles F.J. Non-well-founded sets modeled as ideal fixed points, Information and Computation, vol. 93, no. 1, 1991, pp.16\u201354.","journal-title":"Information and Computation"},{"key":"16_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4153-7","volume-title":"Notes in set theory","author":"Y.N. Moschovakis","year":"1994","unstructured":"Moschovakis Y.N. Notes in set theory, Springer-Verlag, New York, 1994."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Neven J., Van den Bussche J., Van Gucht D., Vossen G. Typed query languages for databases containing queries, Information Systems, 1999, to appear.","DOI":"10.1016\/S0306-4379(99)00033-2"},{"issue":"2","key":"16_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(93)90345-T","volume":"119","author":"V.Yu. Sazonov","year":"1993","unstructured":"Sazonov V.Yu. Hereditarily finite sets, data bases and polynomial-time computability, Theoretical Computer Science, vol. 119, no. 2, 1993, pp. 187\u2013214.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1109\/69.250091","volume":"5","author":"S.V. Vrbsky","year":"1993","unstructured":"Vrbsky S.V., Liu J.W.S. APPROXIMATE: A query processor that produces monotonically improving approximate answers, Transactions on Knowledge and Data Engineering, vol. 5, no. 6, December 1993, pp. 1056\u20131068.","journal-title":"Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1006\/jcss.1996.0040","volume":"52","author":"J. Bussche Van den","year":"1996","unstructured":"Van den Bussche J., Van Guch D., Vossen G. Reflective programming in the relational algebra, Journal of Computer and System Sciences, vol. 52, no. 3, pp. 537\u2013549, 1996.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46564-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T07:56:42Z","timestamp":1550735802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46564-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671008","9783540465645"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46564-2_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}