{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T22:02:23Z","timestamp":1771020143585,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030021481","type":"print"},{"value":"9783030021498","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02149-8_1","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T17:25:34Z","timestamp":1538760334000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finite Relation Algebras with Normal Representations"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-70583-3_16","volume-title":"Automata, Languages and Programming","author":"M Bodirsky","year":"2008","unstructured":"Bodirsky, M., Grohe, M.: Non-dichotomies in constraint satisfaction complexity. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 184\u2013196. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_16"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Hils, M., Martin, B.: On the scope of the universal-algebraic approach to constraint satisfaction. In: Proceedings of the Annual Symposium on Logic in Computer Science (LICS), pp. 90\u201399. IEEE Computer Society, July 2010","DOI":"10.1109\/LICS.2010.13"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1613\/jair.5260","volume":"58","author":"M Bodirsky","year":"2017","unstructured":"Bodirsky, M., Jonsson, P.: A model-theoretic view on qualitative constraint reasoning. J. Artif. Intell. Res. 58, 339\u2013385 (2017)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3105907","volume":"18","author":"Manuel Bodirsky","year":"2017","unstructured":"Bodirsky, M., Jonsson, P., Van Pham, T.: The complexity of phylogeny constraint satisfaction problems. ACM Trans. Comput. Logic (TOCL) 18(3) (2017). An extended abstract appeared in the conference STACS 2016","journal-title":"ACM Transactions on Computational Logic"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of temporal constraint satisfaction problems. In: Dwork, C. (ed.) Proceedings of the Annual Symposium on Theory of Computing (STOC), pp. 29\u201338. ACM, May 2008","DOI":"10.1145\/1374376.1374382"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Barto, L., Kozik, M.: Constraint satisfaction problems of bounded width. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), pp. 595\u2013603 (2009)","DOI":"10.1109\/FOCS.2009.32"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"AA Bulatov","year":"2005","unstructured":"Bulatov, A.A., Krokhin, A.A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34, 720\u2013742 (2005)","journal-title":"SIAM J. Comput."},{"key":"1_CR8","unstructured":"Barto, L., Kompatscher, M., Ol\u0161\u00e1k, M., Pinsker, M., Van Pham, T.: The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. In: Proceedings of the 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science - LICS 2017 (2017). Preprint arXiv:1612.07551"},{"key":"1_CR9","unstructured":"Bodirsky, M., Mottet, A.: Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. In: Proceedings of the 31th Annual IEEE Symposium on Logic in Computer Science - LICS 2016, pp. 623\u2013632 (2016). Preprint available at ArXiv:1601.04520"},{"key":"1_CR10","unstructured":"Bodirsky, M., Madelaine, F., Mottet, A.: A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. In: Proceedings of the Symposium on Logic in Computer Science - LICS 2018 (2018). Preprint available under ArXiv:1802.03255"},{"key":"1_CR11","unstructured":"Bodirsky, M., Martin, B., Pinsker, M., Pongr\u00e1cz, A.: Constraint satisfaction problems for reducts of homogeneous graphs. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, 11\u201315 July 2016, Rome, Italy, pp. 119:1\u2013119:14 (2016)"},{"key":"1_CR12","unstructured":"Bodirsky, M.: Constraint satisfaction with infinite domains. Dissertation, Humboldt-Universit\u00e4t zu Berlin (2004)"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-3(1:2)2007","volume":"3","author":"M Bodirsky","year":"2007","unstructured":"Bodirsky, M.: Cores of countably categorical structures. Logical Methods Comput. Sci. 3(1), 1\u201316 (2007)","journal-title":"Logical Methods Comput. Sci."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-92800-3_8","volume-title":"Complexity of Constraints","author":"M Bodirsky","year":"2008","unstructured":"Bodirsky, M.: Constraint satisfaction problems with infinite templates. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 196\u2013228. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92800-3_8"},{"key":"1_CR15","unstructured":"Bodirsky, M.: Complexity classification in infinite-domain constraint satisfaction. M\u00e9moire d\u2019habilitation \u00e0 diriger des recherches, Universit\u00e9 Diderot - Paris 7 arXiv:1201.0856 (2012)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Barto, L., Opr\u0161al, J., Pinsker, M.: The wonderland of reflections. Isr. J. Math. (2017, to appear) Preprint arXiv:1510.04521","DOI":"10.1007\/s11856-017-1621-9"},{"key":"1_CR17","unstructured":"Barto, L., Pinsker, M.: The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems. In: Proceedings of the 31th Annual IEEE Symposium on Logic in Computer Science - LICS 2016, pp. 615\u2013622 (2016). Preprint arXiv:1602.04353"},{"issue":"3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00012-017-0427-2","volume":"77","author":"Manuel Bodirsky","year":"2017","unstructured":"Bodirsky, M., Schneider, F.M.: A topological characterisation of endomorphism monoids of countable structures. Algebra Universalis 77(3), 251\u2013269 (2016). Preprint available at arXiv:1508.07404","journal-title":"Algebra universalis"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Bulatov, A.A.: A dichotomy theorem for nonuniform CSPs. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15\u201317 October 2017, pp. 319\u2013330 (2017)","DOI":"10.1109\/FOCS.2017.37"},{"key":"1_CR20","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. Artif. Intell. Rev. 23, 315\u2013357 (2005)","journal-title":"Artif. Intell. Rev."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.24033\/asens.1027","volume":"71","author":"R Fra\u00efss\u00e9","year":"1954","unstructured":"Fra\u00efss\u00e9, R.: Sur l\u2019extension aux relations de quelques propri\u00e9t\u00e9s des ordres. Annales Scientifiques de l\u2019\u00c9cole Normale Sup\u00e9rieure 71, 363\u2013388 (1954)","journal-title":"Annales Scientifiques de l\u2019\u00c9cole Normale Sup\u00e9rieure"},{"key":"1_CR22","volume-title":"Theory of Relations","author":"R Fra\u00efss\u00e9","year":"1986","unstructured":"Fra\u00efss\u00e9, R.: Theory of Relations. Elsevier Science Ltd, North-Holland (1986)"},{"issue":"4","key":"1_CR23","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1090\/S0002-9947-99-02264-3","volume":"353","author":"R Hirsch","year":"2001","unstructured":"Hirsch, R., Hodkinson, I.: Representability is not decidable for finite relation algebras. Trans. Am. Math. Soc. 353(4), 1387\u20131401 (2001)","journal-title":"Trans. Am. Math. Soc."},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00042-9","volume":"83","author":"R Hirsch","year":"1996","unstructured":"Hirsch, R.: Relation algebras of intervals. Artif. Intell. J. 83, 1\u201329 (1996)","journal-title":"Artif. Intell. J."},{"issue":"3","key":"1_CR25","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. J. Logic Comput. 7(3), 309\u2013351 (1997)","journal-title":"J. Logic Comput."},{"issue":"4","key":"1_CR26","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1093\/jigpal\/7.4.547","volume":"7","author":"R Hirsch","year":"1999","unstructured":"Hirsch, R.: A finite relation algebra with undecidable network satisfaction problem. Logic J. IGPL 7(4), 547\u2013554 (1999)","journal-title":"Logic J. IGPL"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.artint.2012.09.009","volume":"195","author":"J Huang","year":"2013","unstructured":"Huang, J., Li, J.J., Renz, J.: Decomposition and tractability in qualitative spatial and temporal reasoning. Artif. Intell. 195, 140\u2013164 (2013)","journal-title":"Artif. Intell."},{"key":"1_CR28","volume-title":"A Shorter Model Theory","author":"W Hodges","year":"1997","unstructured":"Hodges, W.: A Shorter Model Theory. Cambridge University Press, Cambridge (1997)"},{"key":"1_CR29","unstructured":"Kompatscher, M., Van Pham, T.: A complexity dichotomy for poset constraint satisfaction. In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 47:1\u201347:12 (2017)"},{"key":"1_CR30","unstructured":"Li, J.J., Kowalski, T., Renz, J., Li, S.: Combining binary constraint networks in qualitative reasoning. In: ECAI 2008\u201318th European Conference on Artificial Intelligence, Patras, Greece, 21\u201325 July 2008, Proceedings, pp. 515\u2013519 (2008)"},{"issue":"3","key":"1_CR31","doi-asserted-by":"publisher","first-page":"707","DOI":"10.2307\/1969375","volume":"51","author":"R Lyndon","year":"1950","unstructured":"Lyndon, R.: The representation of relational algebras. Ann. Math. 51(3), 707\u2013729 (1950)","journal-title":"Ann. Math."},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Zhuk, D.: A proof of CSP dichotomy conjecture. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15\u201317 October 2017, pp. 331\u2013342 (2017)","DOI":"10.1109\/FOCS.2017.38"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02149-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T11:06:16Z","timestamp":1572001576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02149-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030021481","9783030021498"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02149-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ramics-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.06","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1 full invited talk","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}