{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:51Z","timestamp":1747548351912},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430759"},{"type":"electronic","value":"9783540455752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45575-2_38","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T01:30:22Z","timestamp":1180575022000},"page":"378-394","source":"Crossref","is-referenced-by-count":5,"title":["Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Sazonov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, Querying semi-structured data. Database Theory\u2014 ICDT\u201997, 6th International Conference, Springer, 1997, 1\u201318","DOI":"10.1007\/3-540-62222-5_33"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu, Queries and computation on the Web. Database Theory \u2014 ICDT\u201997, 6th International Conference, Springer, 1997","DOI":"10.1007\/3-540-62222-5_50"},{"key":"38_CR3","unstructured":"P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes. No 14 (1988)"},{"key":"38_CR4","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Final Universes of Processes","author":"P. Aczel","year":"1994","unstructured":"P. Aczel, Final Universes of Processes, 9th Internat. Conf. on Math. Foundations of Programming Semantics, ed. S. Brookes, et al. Springer LNCS 802 (1994), 1\u201328"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"P. Aczel, Lectures on Semantics: The initial algebra and final coalgebra perspectives, Logic of Computation, ed. H. Schwichtenberg, Springer (1997)","DOI":"10.1007\/978-3-642-59048-1_1"},{"key":"38_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets and Structures","author":"J.K. Barwise","year":"1975","unstructured":"J.K. Barwise, Admissible Sets and Structures. Springer, Berlin, 1975"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"P. Buneman, S. Davidson, G. Hillebrand, D. Suciu, A query Language and Optimisation Techniques for Unstructured Data. Proc. of SIGMOD, San Diego, 1996","DOI":"10.1145\/233269.233368"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"L. Cardelli, Semistructured Computation, Febr. 1, 2000; and other papers on mobile ambient calculi available via http:\/\/www.luca.demon.co.uk\/","DOI":"10.1007\/3-540-44543-9_1"},{"key":"38_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/3-540-16442-1_12","volume-title":"The choice of programming primitives for SETLlike programming languages","author":"E. Dahlhaus","year":"1986","unstructured":"E. Dahlhaus and J.A. Makowsky, The choice of programming primitives for SETLlike programming languages, Proceedings of ESOP\u201986 (European Symp. on Programming, Saarbr\u00fcken, March 17\u201319, 1986), B. Robinet and R. Wilhelm eds., LNCS 213 (1986), 160\u2013172."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90074-P","volume":"101.1","author":"E. Dahlhaus","year":"1992","unstructured":"E. Dahlhaus and J.A. Makowsky, Query languages for hierarchic databases, Information and Computation vol 101.1, (1992), pp. 1\u201332.","journal-title":"Information and Computation"},{"key":"38_CR11","unstructured":"A. Davison, L. Sterling and S.W. Loke, LogicWeb: LOGIC Programming for the World-Wide WEB, http:\/\/www.cs.mu.oz.au\/~swloke\/logicweb.html"},{"key":"38_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-45347-5_7","volume-title":"Principles of Mobile Maude","author":"F. Dur\u00e1n","year":"2000","unstructured":"F. Dur\u00e1n, S. Eker, P. Lincoln, and J. Meseguer, Principles of Mobile Maude, LNCS, 1882, Springer-Verlag. 2000, 73\u201385."},{"key":"38_CR13","series-title":"Lect Notes Comput Sci","first-page":"131","volume-title":"On the Formal Semantics of Design Languages: A compilation approach using Abstract State Machines","author":"R. Eschbach","year":"2000","unstructured":"R. Eschbach, U. Gl\u00e4sser, R. Gotzhein, and A. Prinz, On the Formal Semantics of Design Languages: A compilation approach using Abstract State Machines, Springer LNCS 1912 2000, 131\u2013151"},{"key":"38_CR14","unstructured":"R. Fagin, Generalized first order spectra and polynomial time recognizable sets, Complexity of Computations, SIAM\u2014 AMS Proc. 7, 1974, 43\u201373"},{"key":"38_CR15","unstructured":"M. Fisher and M. Wooldridge, On the Formal Specification and Verification of Multi-Agent Systems. Intern. J. of Cooperative Information Systems, 6(1), 1997"},{"key":"38_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/3-540-61604-7_67","volume-title":"CONCUR\u201996","author":"C. Fournet","year":"1996","unstructured":"C. Fournet, G. Gonthier, J-J. L\u00e9vy, L. Maranget, and D. R\u00e9my, A Calculus of Mobile Agents, CONCUR\u201996, Springer LNCS 1119 (1996), 406\u2013421"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"R.O. Gandy, Set theoretic functions for elementary syntax. Proc. Symp. in Pure Math. Vol. 13, Part II (1974), 103\u2013126.","DOI":"10.1090\/pspum\/013.2\/0376348"},{"key":"38_CR18","first-page":"210","volume":"24","author":"Y. Gurevich","year":"1983","unstructured":"Y. Gurevich, Algebras of feasible functions. FOCS 24 (1983), 210\u2013214","journal-title":"FOCS"},{"key":"38_CR19","unstructured":"Y. Gurevich at al., Web-site on ASM: http:\/\/www.eecs.umich.edu\/gasm\/"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"N. Immerman, Relational queries computable in polynomial time, Proc. 14th. ACM Symp. on Theory of Computing, (1982) 147\u2013152","DOI":"10.1145\/800070.802187"},{"key":"38_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0003-4843(72)90001-0","volume":"4","author":"R.B. Jensen","year":"1972","unstructured":"R.B. Jensen, The fine structure of the constructible hierarchy. Ann. Math. Logic 4 (1972), 229\u2013308.","journal-title":"Ann. Math. Logic"},{"key":"38_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/3-540-46564-2_10","volume-title":"Foiks\u20192000","author":"A. Leontjev","year":"2000","unstructured":"A. Leontjev and V. Sazonov, Capturing LOGSPACE over Hereditarily-Finite Sets, Foiks\u20192000, Springer LNCS 1762 (2000), 156\u2013175"},{"key":"38_CR23","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(96)00174-0","volume":"175","author":"A. Lisitsa","year":"1997","unstructured":"A. Lisitsa and V. Sazonov, Delta-languages for sets and LOGSPACE computable graph transformers. Theoretical Computer Science 175, 1 (1997), 183\u2013222","journal-title":"Theoretical Computer Science"},{"key":"38_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/3-540-63385-5_42","volume-title":"KGC\u201997","author":"A. Lisitsa","year":"1997","unstructured":"A. Lisitsa, and V. Sazonov, Bounded Hyper-set Theory and Web-like Data Bases, KGC\u201997, Springer LNCS 1289 (1997), 172\u2013185"},{"key":"38_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(98)00312-0","volume":"224","author":"A. Lisitsa","year":"1999","unstructured":"A. Lisitsa and V. Sazonov, Linear ordering on graphs, anti-founded sets and polynomial time computability, Theoretical Computer Science 224, 1\u20132 (1999) 173\u2013213","journal-title":"Theoretical Computer Science"},{"key":"38_CR26","unstructured":"A.B. Livchak, Languages of polynomial queries. Raschet i optimizacija teplotehnicheskih ob\u2019ektov s pomosh\u2019ju EVM, Sverdlovsk, 1982, p. 41 (in Russian)"},{"issue":"1","key":"38_CR27","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/s007990050004","volume":"1","author":"A.O. Mendelzon","year":"1997","unstructured":"A.O. Mendelzon, G.A. Mihaila, T. Milo, Querying the World Wide Web, Int. J. on Digital Libraries 1(1): 54\u201367 (1997)","journal-title":"Int. J. on Digital Libraries"},{"key":"38_CR28","unstructured":"R. Milner, Communication and Concurrency, Prentice Hall, 1989"},{"issue":"1","key":"38_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, RJ. Parrow and D. Walker, A calculus of mobile processes, Parts 1\u20132, Information and Computation, 100(1), 1\u201366, 1992 (and other papers on Action calculi and the pi-calculus available via http:\/\/www.cl.cam.ac.uk\/users\/rm135\/ )","journal-title":"Information and Computation"},{"key":"38_CR30","unstructured":"Nomadic Pict, http:\/\/www.cl.cam.ac.uk\/users\/pes20\/nomadicpict.html"},{"key":"38_CR31","unstructured":"A. Sahuguet, B. Pierce and Val Tannen, Distributed Query Optimization: Can Mobile Agents Help? 2000, cf. http:\/\/db.cis.upenn.edu\/Publications\/"},{"issue":"7","key":"38_CR32","first-page":"319","volume":"16","author":"V. Sazonov","year":"1980","unstructured":"V. Sazonov, Polynomial computability and recursivity in finite domains. Elektronische Informationsverarbeitung und Kybernetik, 16 (7) (1980) 319\u2013323","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"38_CR33","series-title":"Lect Notes Comput Sci","first-page":"188","volume-title":"Bounded set theory and polynomial computability","author":"V. Sazonov","year":"1987","unstructured":"V. Sazonov, Bounded set theory and polynomial computability. All Union Conf. Appl. Logic., Proc. Novosibirsk, 1985, 188\u2013191 (In Russian) Cf. also essentially extended English version with new results in FCT\u201987, LNCS 278 (1987), 391\u2013397"},{"key":"38_CR34","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(93)90345-T","volume":"119","author":"V. Sazonov","year":"1993","unstructured":"V. Sazonov, Hereditarily-finite sets, data bases and polynomial-time computability. TCS, 119 Elsevier (1993), 187\u2013214","journal-title":"TCS"},{"key":"38_CR35","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/BFb0022280","volume-title":"CSL\u201994","author":"V. Sazonov","year":"1995","unstructured":"V. Sazonov, A bounded set theory with anti-foundation axiom and inductive definability, CSL\u201994 Springer LNCS 933 (1995) 527\u2013541"},{"key":"38_CR36","doi-asserted-by":"crossref","unstructured":"V. Sazonov, On Bounded Set Theory. Invited talk on the 10th International Congress on Logic, Methodology and Philosophy of Sciences, in Volume I: Logic and Scientific Method, Kluwer Academic Publishers, 1997, 85\u2013103","DOI":"10.1007\/978-94-017-0487-8_5"},{"key":"38_CR37","unstructured":"V. Sazonov, Web-like Databases, Anti-Founded Sets and Inductive Definability, Programmirovanie, 1999, N5, 26\u201343 (In Russian; cf. also English version of this J.)."},{"key":"38_CR38","unstructured":"V. Sazonov and Yu. Serdyuk, Experimental implementation of set-theoretic query language Delta to Web-like databases (in Russian), Programmnye Systemy, Teoreticheskie Osnovy i prilozhenija, RAN, Institut Programmnyh System, Moskva, Nauka, Fizmatlit, 1999"},{"key":"38_CR39","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-46564-2_16","volume-title":"FoIKS\u20192000","author":"Yu. Serdyuk","year":"2000","unstructured":"Yu. Serdyuk, Partial Evaluation in a Set-Theoretic Query Language for WWW, FoIKS\u20192000, Springer LNCS 1762 (2000), 260\u2013274"},{"key":"38_CR40","doi-asserted-by":"crossref","unstructured":"D. Suciu, Distributed Query Evaluation on Semistructured Data, 1997. Available from http:\/\/www.research.att.com\/~suciu","DOI":"10.1145\/271074.271077"},{"key":"38_CR41","unstructured":"D. Suciu, Query decomposition and view maintenance for query languages for unstructured data, Proc. of the Internat. Conf. on Very Large Data Bases, 1996"},{"key":"38_CR42","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi, The complexity of relational query languages. Proc. of the 14th. ACM Symp. on Theory of Computing, (1982) 137\u2013146","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45575-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T14:13:06Z","timestamp":1587564786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45575-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430759","9783540455752"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/3-540-45575-2_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}