{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:54:01Z","timestamp":1725490441221},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73420-8_48","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"546-557","source":"Crossref","is-referenced-by-count":1,"title":["Maximal Infinite-Valued Constraint Languages"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubie","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"K\u00e1ra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"von Oertzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"48_CR1","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"},{"key":"48_CR2","unstructured":"Bodirsky, M.: Cores of countably categorical structures. Logical Methods in Computer Science (LMCS) (2007), doi:DOI: 10.2168\/LMCS-3(1:2)"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Chen, H.: Oligomorphic clones. Algebra Universalis (to appear, 2007)","DOI":"10.1007\/s00012-007-2026-0"},{"key":"48_CR4","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":"48_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2006)"},{"issue":"3","key":"48_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1093\/logcom\/exi083","volume":"16","author":"M. Bodirsky","year":"2006","unstructured":"Bodirsky, M., Ne\u0161et\u0159il, J.: Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation\u00a016(3), 359\u2013373 (2006)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"48_CR7","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":"48_CR8","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":"48_CR9","doi-asserted-by":"crossref","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.: The complexity of maximal constraint languages. In: Proceedings of STOC 2001, pp. 667\u2013674 (2001)","DOI":"10.1145\/380752.380868"},{"key":"48_CR10","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"},{"key":"48_CR11","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.: algebras and their application in temporal and spatial reasoning. Artificial Intelligence Review\u00a023, 315\u2013357 (2005)","journal-title":"Artificial Intelligence Review"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Evans, D.: Examples of ${\\aleph_{0}}$ -categorical structures. In: Automorphisms of first-order structures, pp. 33\u201372 (1994)","DOI":"10.1093\/oso\/9780198534686.003.0002"},{"key":"48_CR13","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":"48_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1112\/jlms\/51.2.219","volume":"51","author":"T. Gardener","year":"1995","unstructured":"Gardener, T.: Infinite dimensional classical groups. J. London Math. Soc\u00a051, 219\u2013229 (1995)","journal-title":"J. London Math. Soc"},{"key":"48_CR15","volume-title":"A Guide to NP-completeness","author":"Garey","year":"1978","unstructured":"Garey, Johnson.: A Guide to NP-completeness. CSLI Press, Stanford (1978)"},{"key":"48_CR16","volume-title":"A shorter model theory","author":"W. Hodges","year":"1997","unstructured":"Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"48_CR17","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P. Jeavons","year":"1997","unstructured":"Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM\u00a044(4), 527\u2013548 (1997)","journal-title":"Journal of the ACM"},{"key":"48_CR18","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."},{"issue":"5","key":"48_CR19","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. Journal of the ACM\u00a050(5), 591\u2013640 (2003)","journal-title":"Journal of the ACM"},{"issue":"1","key":"48_CR20","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. Journal of the ACM\u00a042(1), 43\u201366 (1995)","journal-title":"Journal of the ACM"},{"issue":"1-2","key":"48_CR21","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":"48_CR22","first-page":"405","volume":"43","author":"I.G. Rosenberg","year":"1986","unstructured":"Rosenberg, I.G.: Minimal clones I: the five types. Lectures in Universal Algebra (Proc. Conf. Szeged, 1983), Colloq. Math. Soc. J. Bolyai\u00a043, 405\u2013427 (1986)","journal-title":"Lectures in Universal Algebra (Proc. Conf. Szeged, 1983), Colloq. Math. Soc. J. Bolyai"},{"key":"48_CR23","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF02488043","volume":"9","author":"J.H. Schmerl","year":"1979","unstructured":"Schmerl, J.H.: Countable homogeneous partially ordered sets. Algebra Universalis\u00a09, 317\u2013321 (1979)","journal-title":"Algebra Universalis"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T16:00:18Z","timestamp":1708185618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734192","9783540734208"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}