{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T09:53:46Z","timestamp":1772445226907,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540927990","type":"print"},{"value":"9783540928003","type":"electronic"}],"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-92800-3_8","type":"book-chapter","created":{"date-parts":[[2008,12,22]],"date-time":"2008-12-22T08:39:25Z","timestamp":1229935165000},"page":"196-228","source":"Crossref","is-referenced-by-count":23,"title":["Constraint Satisfaction Problems with Infinite Templates"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF02120830","volume":"30","author":"A. Abian","year":"1972","unstructured":"Abian, A.: Categoricity of denumerable atomless boolean rings. Studia Logica\u00a030(1), 63\u201367 (1972)","journal-title":"Studia Logica"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Adeleke, S., Neumann, P.M.: Structure of partially ordered sets with transitive automorphism groups. AMS Memoir 57(334) (1985)","DOI":"10.1090\/memo\/0334"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1112\/plms\/s3-72.1.63","volume":"s3-72","author":"S.A. Adeleke","year":"1996","unstructured":"Adeleke, S.A., Macpherson, D.: Classification of infinite primitive jordan permutation groups. Proceedings of the London Mathematical Society\u00a0s3-72(1), 63\u2013123 (1996)","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A. Aho","year":"1981","unstructured":"Aho, A., Sagiv, Y., Szymanski, T., Ullman, J.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"11","key":"8_CR5","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM\u00a026(11), 832\u2013843 (1983)","journal-title":"Communications of the ACM"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/jctb.1994.1040","volume":"61","author":"B.L. Bauslaugh","year":"1994","unstructured":"Bauslaugh, B.L.: The complexity of infinite h-coloring. J. Comb. Theory, Ser. B\u00a061(2), 141\u2013154 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"8_CR7","unstructured":"Bodirsky, M.: Cores of countably categorical structures. In: Logical Methods in Computer Science, LMCS (2007), doi:10.2168\/LMCS-3(1:2)"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00012-007-2026-0","volume":"57","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky, M., Chen, H.: Oligomorphic clones. Algebra Universalis\u00a057(1), 109\u2013125 (2007)","journal-title":"Algebra Universalis"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-74915-8_17","volume-title":"Computer Science Logic","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky, M., Chen, H.: Qualitative temporal and spatial reasoning revisited. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 194\u2013207. Springer, Heidelberg (2007)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-540-73420-8_48","volume-title":"Automata, Languages and Programming","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky, M., Chen, H., Kara, J., von Oertzen, T.: Maximal infinite-valued constraint languages. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 546\u2013557. Springer, Heidelberg (2007)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/11672142_53","volume-title":"STACS 2006","author":"M. Bodirsky","year":"2006","unstructured":"Bodirsky, M., Dalmau, V.: Datalog and constraint satisfaction with infinite templates. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 646\u2013659. Springer, Heidelberg (2006)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11753728_14","volume-title":"Computer Science \u2013 Theory and Applications","author":"M. Bodirsky","year":"2006","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of equality constraint languages. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol.\u00a03967, pp. 114\u2013126. Springer, Heidelberg (2006)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of temporal constraint satisfaction problems (preprint, 2007)","DOI":"10.1145\/1374376.1374382"},{"key":"8_CR14","unstructured":"Bodirsky, M., K\u00e1ra, J.: A fast algorithm and lower bound for temporal reasoning (preprint, 2007)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/3-540-45841-7_23","volume-title":"STACS 2002","author":"M. Bodirsky","year":"2002","unstructured":"Bodirsky, M., Kutz, M.: Pure dominance constraints. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 287\u2013298. Springer, Heidelberg (2002)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.artint.2006.12.004","volume":"171","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky, M., Kutz, M.: Determining the consistency of partial tree descriptions. Artificial Intelligence\u00a0171, 185\u2013196 (2007)","journal-title":"Artificial Intelligence"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-45220-1_5","volume-title":"Computer Science Logic","author":"M. Bodirsky","year":"2003","unstructured":"Bodirsky, M., Ne\u0161et\u0159il, J.: Constraint satisfaction with countable homogeneous templates. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 44\u201357. Springer, Heidelberg (2003)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01070906","volume":"5","author":"V.G. Bodnar\u010duk","year":"1969","unstructured":"Bodnar\u010duk, V.G., Kalu\u017enin, L.A., Kotov, V.N., Romov, B.A.: Galois theory for post algebras, part I and II. Cybernetics\u00a05, 243\u2013539 (1969)","journal-title":"Cybernetics"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0004-3702(03)00075-4","volume":"149","author":"M. Broxvall","year":"2003","unstructured":"Broxvall, M., Jonsson, P.: Point algebras for temporal reasoning: Algorithms and complexity. Artif. Intell.\u00a0149(2), 179\u2013220 (2003)","journal-title":"Artif. Intell."},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Bulatov, A.: A graph of a relational structure and constraint satisfaction problems. In: Proceedings of the 19th IEEE Annual Symposium on Logic in Computer Science (LICS 2004), Turku, Finland (2004)","DOI":"10.1109\/LICS.2004.1319639"},{"key":"8_CR21","unstructured":"Bulatov, A., Jeavons, P.: Algebraic structures in combinatorial problems. Technical report MATH-AL-4-2001, Technische Universitat Dresden. International Journal of Algebra and Computing (submitted, 2001)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing\u00a034, 720\u2013742 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1137\/050628957","volume":"36","author":"A.A. Bulatov","year":"2006","unstructured":"Bulatov, A.A., Dalmau, V.: A simple algorithm for Mal\u2019tsev constraints. SIAM J. Comput.\u00a036(1), 16\u201327 (2006)","journal-title":"SIAM J. Comput."},{"key":"8_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8130-3","volume-title":"A Course in Universal Algebra","author":"S. Burris","year":"1981","unstructured":"Burris, S., Sankappanavar, H.: A Course in Universal Algebra. Springer, Berlin (1981)"},{"key":"8_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511549809","volume-title":"Oligomorphic Permutation Groups","author":"P.J. Cameron","year":"1990","unstructured":"Cameron, P.J.: Oligomorphic Permutation Groups. Cambridge Univ. Press, Cambridge (1990)"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0168-0072(85)90023-5","volume":"28","author":"G. Cherlin","year":"1985","unstructured":"Cherlin, G., Harrington, L., Lachlan, A.: $\\aleph_0$ -categorical, $\\aleph_0$ -stable structures. Annals of Pure and Applied Logic\u00a028, 103\u2013135 (1985)","journal-title":"Annals of Pure and Applied Logic"},{"key":"8_CR27","volume-title":"Finite Structures with Few Types","author":"G. Cherlin","year":"2003","unstructured":"Cherlin, G., Hrushovski, E.: Finite Structures with Few Types. Princeton University Press, Princeton (2003)"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1090\/S0002-9947-1986-0846608-8","volume":"296","author":"G. Cherlin","year":"1986","unstructured":"Cherlin, G., Lachlan, A.H.: Stable finitely homogeneous structures. TAMS\u00a0296, 815\u2013850 (1986)","journal-title":"TAMS"},{"issue":"5","key":"8_CR29","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/355483.355485","volume":"47","author":"D. Cohen","year":"2000","unstructured":"Cohen, D., Jeavons, P., Jonsson, P., Koubarakis, M.: Building tractable disjunctive constraints. Journal of the ACM\u00a047(5), 826\u2013853 (2000)","journal-title":"Journal of the ACM"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Droste, M.: Structure of partially ordered sets with transitive automorphism groups. AMS Memoir\u00a057(334) (1985)","DOI":"10.1090\/memo\/0334"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10462-004-5899-8","volume":"23","author":"I. D\u00fcntsch","year":"2005","unstructured":"D\u00fcntsch, I.: Relation algebras and their application in temporal and spatial reasoning. Artificial Intelligence Review\u00a023, 315\u2013357 (2005)","journal-title":"Artificial Intelligence Review"},{"key":"8_CR32","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"key":"8_CR33","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/oso\/9780198534686.003.0002","volume-title":"Automorphisms of first-order structures","author":"D. Evans","year":"1994","unstructured":"Evans, D.: Examples of $\\aleph_0$ -categorical structures. In: Kaye, R., Macpherson, H.D. (eds.) Automorphisms of first-order structures, pp. 33\u201372. Oxford University Press, Oxford (1994)"},{"issue":"1","key":"8_CR34","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1137\/S0895480103422184","volume":"17","author":"T. Feder","year":"2003","unstructured":"Feder, T., Hell, P., Mohar, B.: Acyclic homomorphisms and circular colorings of digraphs. SIAM J. Discrete Math.\u00a017(1), 161\u2013169 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"8_CR35","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1999","unstructured":"Feder, T., Vardi, M.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing\u00a028, 57\u2013104 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR36","volume-title":"Theory of Relations","author":"R. Fra\u00efss\u00e9","year":"1986","unstructured":"Fra\u00efss\u00e9, R.: Theory of Relations. North-Holland, Amsterdam (1986)"},{"key":"8_CR37","unstructured":"Garey, M., Johnson, D.: A guide to NP-completeness. CSLI Press (1978)"},{"key":"8_CR38","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2140\/pjm.1968.27.95","volume":"27","author":"D. Geiger","year":"1968","unstructured":"Geiger, D.: Closed systems of functions and predicates. Pacific Journal of Mathematics\u00a027, 95\u2013100 (1968)","journal-title":"Pacific Journal of Mathematics"},{"key":"8_CR39","unstructured":"Goldstern, M., Pinsker, M.: A survey of clones on infinite sets. arXiv:0701030 (preprint, 2007)"},{"key":"8_CR40","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Series B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"3","key":"8_CR41","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1093\/logcom\/7.3.309","volume":"7","author":"R. Hirsch","year":"1997","unstructured":"Hirsch, R.: Expressive power and complexity in algebraic logic. Journal of Logic and Computation\u00a07(3), 309\u2013351 (1997)","journal-title":"Journal of Logic and Computation"},{"key":"8_CR42","volume-title":"A shorter model theory","author":"W. Hodges","year":"1997","unstructured":"Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)"},{"key":"8_CR43","doi-asserted-by":"crossref","unstructured":"Idziak, P.M., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and learnability arising from algebras with few subpowers. In: LICS, pp. 213\u2013224 (2007)","DOI":"10.1109\/LICS.2007.50"},{"key":"8_CR44","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1613\/jair.379","volume":"6","author":"P. Jonsson","year":"1997","unstructured":"Jonsson, P., Drakengren, T.: A complete classification of tractability in RCC-5. J. Artif. Intell. Res.\u00a06, 211\u2013221 (1997)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR45","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1112\/plms\/s3-59.3.439","volume":"59","author":"W.M. Kantor","year":"1989","unstructured":"Kantor, W.M., Macpherson, H.D., Liebeck, M.W.: $\\aleph_0$ -categorical structures smoothly approximated by finite substructures. Proc. London Math. Soc.\u00a059, 439\u2013463 (1989)","journal-title":"Proc. London Math. Soc."},{"key":"8_CR46","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1090\/S0002-9947-1965-0170812-4","volume":"117","author":"J. Keisler","year":"1965","unstructured":"Keisler, J.: Reduced products and Horn classes. Trans. Amer. Math. Soc.\u00a0117, 307\u2013328 (1965)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"3","key":"8_CR47","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00224-005-1279-2","volume":"40","author":"O. Kl\u00edma","year":"2007","unstructured":"Kl\u00edma, O., Tesson, P., Th\u00e9rien, D.: Dichotomies in the complexity of solving systems of equations over finite semigroups. Theory Comput. Syst.\u00a040(3), 263\u2013297 (2007)","journal-title":"Theory Comput. Syst."},{"key":"8_CR48","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(00)00177-8","volume":"266","author":"M. Koubarakis","year":"2001","unstructured":"Koubarakis, M.: Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning. Theoretical Computer Science\u00a0266, 311\u2013339 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"8_CR49","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/876638.876639","volume":"50","author":"A.A. Krokhin","year":"2003","unstructured":"Krokhin, A.A., Jeavons, P., Jonsson, P.: Reasoning about temporal relations: The tractable subalgebras of Allen\u2019s interval algebra. JACM\u00a050(5), 591\u2013640 (2003)","journal-title":"JACM"},{"key":"8_CR50","unstructured":"Kun, G.: Constraints, mmsnp, and expander relational structures. arXiv:0706.1701 (2007)"},{"key":"8_CR51","doi-asserted-by":"crossref","unstructured":"Lachlan, A.H.: Stable finitely homogeneous structures: A survey. In: Algebraic Model Theory, NATO ASI Series, vol.\u00a0496, pp. 145\u2013159 (1996)","DOI":"10.1007\/978-94-015-8923-9_6"},{"issue":"1","key":"8_CR52","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E.: On the structure of polynomial time reducibility. JACM\u00a022(1), 155\u2013171 (1975)","journal-title":"JACM"},{"key":"8_CR53","first-page":"73","volume-title":"Automorphisms of first-order structures","author":"D. Macpherson","year":"1994","unstructured":"Macpherson, D.: A survey of jordan groups. In: Kaye, R., Macpherson, H.D. (eds.) Automorphisms of first-order structures, pp. 73\u2013110. Oxford University Press, Oxford (1994)"},{"key":"8_CR54","first-page":"279","volume":"191","author":"Y. Matiyasevich","year":"1970","unstructured":"Matiyasevich, Y.: Enumerable sets are diophantine. Doklady Akademii Nauk SSSR\u00a0191, 279\u2013282 (1970)","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"1","key":"8_CR55","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/200836.200848","volume":"42","author":"B. Nebel","year":"1995","unstructured":"Nebel, B., B\u00fcrckert, H.-J.: Reasoning about temporal relations: A maximal tractable subclass of Allen\u2019s interval algebra. JACM\u00a042(1), 43\u201366 (1995)","journal-title":"JACM"},{"key":"8_CR56","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"Paterson, M.S., Wegman, M.N.: Linear unification. Journal of Computer and System Sciences\u00a016, 158\u2013167 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8622-1","volume-title":"A Course in Model Theory: An Introduction to Contemporary Mathematical Logic","author":"B. Poizat","year":"2000","unstructured":"Poizat, B.: A Course in Model Theory: An Introduction to Contemporary Mathematical Logic. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"8_CR58","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0004-3702(99)00002-8","volume":"108","author":"J. Renz","year":"1999","unstructured":"Renz, J., Nebel, B.: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus. Artif. Intell.\u00a0108(1-2), 69\u2013123 (1999)","journal-title":"Artif. Intell."},{"key":"8_CR59","unstructured":"Szendrei, A.: Clones in universal Algebra. Seminaire de mathematiques superieures. Les Presses de L\u2019Universite de Montreal (1986)"},{"key":"8_CR60","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1111\/j.1467-8640.1990.tb00130.x","volume":"6","author":"P. Beek van","year":"1990","unstructured":"van Beek, P., Cohen, R.: Exact and approximate reasoning about temporal relations. Computational Intelligence\u00a06, 132\u2013144 (1990)","journal-title":"Computational Intelligence"},{"key":"8_CR61","doi-asserted-by":"crossref","unstructured":"Zilber, B.: Uncountable categorical theories, Tranlations of Mathematical Monographs, vol.\u00a0117. Amer. Math. Soc. (1993)","DOI":"10.1090\/mmono\/117"}],"container-title":["Lecture Notes in Computer Science","Complexity of Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92800-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T10:54:58Z","timestamp":1709808898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92800-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540927990","9783540928003"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92800-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}