{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T07:27:19Z","timestamp":1785223639432,"version":"3.55.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030757748","type":"print"},{"value":"9783030757755","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75775-5_14","type":"book-chapter","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T23:46:09Z","timestamp":1620776769000},"page":"194-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Algebraic View on p-Admissible Concrete Domains for Lightweight Description Logics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4049-221X","authenticated-orcid":false,"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7961-9492","authenticated-orcid":false,"given":"Jakub","family":"Rydval","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,12]]},"reference":[{"issue":"11","key":"14_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"JF Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832\u2013843 (1983)","journal-title":"Commun. ACM"},{"key":"14_CR2","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), Los Altos, Edinburgh (UK), pp. 364\u2013369. Morgan Kaufmann (2005)"},{"key":"14_CR3","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"14_CR4","unstructured":"Baader, F., Hanschke, P.: A schema for integrating concrete domains into concept languages. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI 1991), pp. 452\u2013457 (1991)"},{"key":"14_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/9781139025355","volume-title":"An Introduction to Description Logic","author":"F Baader","year":"2017","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017)"},{"key":"14_CR6","unstructured":"Baader, F., Rydval, J.: An algebraic view on p-admissible concrete domains for lightweight description logics (extended version). LTCS-Report 20-10, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2020). https:\/\/tu-dresden.de\/inf\/lat\/reports#BaRy-LTCS-20-10"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-030-51074-9_24","volume-title":"Automated Reasoning","author":"F Baader","year":"2020","unstructured":"Baader, F., Rydval, J.: Description logics with concrete domains and general concept inclusions revisited. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12166, pp. 413\u2013431. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9_24"},{"key":"14_CR8","unstructured":"Baader, F., Rydval, J.: Using model-theory to find $$\\omega $$-admissible concrete domains. LTCS-Report 20-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2020). https:\/\/tu-dresden.de\/inf\/lat\/reports#BaRy-LTCS-20-01"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1950010","DOI":"10.1142\/S0219061319500107","volume":"19","author":"L Barto","year":"2019","unstructured":"Barto, L., Kompatscher, M., Ol\u0161\u00e1k, M., Van Pham, T., Pinsker, M.: Equations in oligomorphic clones and the Constraint Satisfaction Problem for $$\\omega $$-categorical structures. J. Math. Logic 19(2), 1950010 (2019)","journal-title":"J. Math. Logic"},{"issue":"1\u20132","key":"14_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2007.10.025","volume":"391","author":"P Bell","year":"2008","unstructured":"Bell, P., Potapov, I.: On undecidability bounds for matrix decision problems. Theoret. Comput. Sci. 391(1\u20132), 3\u201313 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR11","unstructured":"Bodirsky, M.: Complexity classification in infinite-domain constraint satisfaction. M\u00e9moire d\u2019Habilitation \u00e0 Diriger des Recherches, Universit\u00e9 Diderot - Paris 7 (2012). https:\/\/arxiv.org\/abs\/1201.0856"},{"issue":"18","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1016\/j.tcs.2008.12.050","volume":"410","author":"M Bodirsky","year":"2009","unstructured":"Bodirsky, M., Chen, H., K\u00e1ra, J., von Oertzen, T.: Maximal infinite-valued constraint languages. Theoret. Comput. Sci. 410(18), 1684\u20131693 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1667053.1667058","volume":"57","author":"M Bodirsky","year":"2010","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of temporal constraint satisfaction problems. J. ACM (JACM) 57(2), 1\u201341 (2010)","journal-title":"J. ACM (JACM)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Madelaine, F., Mottet, A.: A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2018), pp. 105\u2013114 (2018)","DOI":"10.1145\/3209108.3209156"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Bodirsky, M., Pinsker, M., Pongr\u00e1cz, A.: Projective clone homomorphisms. J. Symbolic Logic, 1\u201313 (2019). https:\/\/doi.org\/10.1017\/jsl.2019.23","DOI":"10.1017\/jsl.2019.23"},{"key":"14_CR16","unstructured":"Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and\u2013what else? In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004), pp. 298\u2013302 (2004)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Bulatov, A.A.: A dichotomy theorem for nonuniform CSPs. In: Proceedings of the 58th Annual Symposium on Foundations of Computer Science (FOCS 2017), pp. 319\u2013330. IEEE (2017)","DOI":"10.1109\/FOCS.2017.37"},{"key":"14_CR18","unstructured":"Carapelle, C., Turhan, A.: Description logics reasoning w.r.t. general TBoxes is decidable for concrete domains with the EHD-property. In: Kaminka, G.A., et al. (eds.) Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016). Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 1440\u20131448. IOS Press (2016)"},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1006\/aama.1998.0641","volume":"22","author":"G Cherlin","year":"1999","unstructured":"Cherlin, G., Shelah, S., Shi, N.: Universal graphs with forbidden subgraphs and algebraic closure. Adv. Appl. Math. 22(4), 454\u2013491 (1999)","journal-title":"Adv. Appl. Math."},{"key":"14_CR20","unstructured":"Feder, T., Vardi, M.Y.: Homomorphism closed vs. existential positive. In: Proceedings of the 18th Annual IEEE Symposium of Logic in Computer Science (LICS 2003), pp. 311\u2013320. IEEE (2003)"},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.2140\/pjm.1971.38.69","volume":"38","author":"CW Henson","year":"1971","unstructured":"Henson, C.W.: A family of countable homogeneous graphs. Pac. J. Math. 38(1), 69\u201383 (1971)","journal-title":"Pac. J. Math."},{"key":"14_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511551574","volume-title":"Model Theory","author":"W Hodges","year":"1993","unstructured":"Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)"},{"key":"14_CR23","unstructured":"Hodges, W.: A Shorter Model Theory. Cambridge University Press, Cambridge (1997)"},{"issue":"6","key":"14_CR24","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1093\/bib\/bbv011","volume":"16","author":"R Hoehndorf","year":"2015","unstructured":"Hoehndorf, R., Schofield, P.N., Gkoutos, G.V.: The role of ontologies in biological and biomedical research: a functional perspective. Brief. Bioinform. 16(6), 1069\u20131080 (2015)","journal-title":"Brief. Bioinform."},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.websem.2003.07.001","volume":"1","author":"I Horrocks","year":"2003","unstructured":"Horrocks, I., Patel-Schneider, P.F., van Harmelen, F.: From SHIQ and RDF to OWL: the making of a web ontology language. J. Web Semant. 1(1), 7\u201326 (2003)","journal-title":"J. Web Semant."},{"key":"14_CR26","unstructured":"Hubi\u010dka, J., Ne\u0161et\u0159il, J.: Homomorphism and embedding universal structures for restricted classes. J. Mult.-Valued Log. Soft Comput. 27, 229\u2013253 (2016). https:\/\/arxiv.org\/abs\/0909.4939"},{"key":"14_CR27","unstructured":"Jaax, S., Kiefer, S.: On affine reachability problems. In: Esparza, J., Kr\u00e1l\u2019, D. (eds.) Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 170, pp. 48:1\u201348:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020)"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Kegel, O.H., Wehrfritz, B.A.: Locally Finite Groups. Elsevier, Amsterdam (2000)","DOI":"10.1142\/4101"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Labai, N., Ortiz, M., Simkus, M.: An ExpTime upper bound for $$\\cal{ALC}$$ with integers. In: Calvanese, D., Erdem, E., Thielscher, M. (eds.) Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), pp. 614\u2013623 (2020)","DOI":"10.24963\/kr.2020\/61"},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.artint.2003.08.001","volume":"152","author":"C Lutz","year":"2004","unstructured":"Lutz, C.: Combining interval-based temporal reasoning with general TBoxes. Artif. Intell. 152(2), 235\u2013274 (2004)","journal-title":"Artif. Intell."},{"issue":"1\u20133","key":"14_CR31","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10817-006-9049-7","volume":"38","author":"C Lutz","year":"2007","unstructured":"Lutz, C., Milicic, M.: A tableau algorithm for description logics with concrete domains and general Tboxes. J. Autom. Reason. 38(1\u20133), 227\u2013259 (2007)","journal-title":"J. Autom. Reason."},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.aim.2014.08.008","volume":"267","author":"PP Pach","year":"2014","unstructured":"Pach, P.P., Pinsker, M., Pluh\u00e1r, G., Pongr\u00e1cz, A., Szab\u00f3, C.: Reducts of the random partial order. Adv. Math. 267, 94\u2013120 (2014)","journal-title":"Adv. Math."},{"key":"14_CR33","unstructured":"Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. In: Proceedings of the 3rd International Conference on the Principles of Knowledge Representation and Reasoning (KR 1992), Los Altos. pp. 165\u2013176. Morgan Kaufmann (1992)"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Zhuk, D.: A proof of CSP dichotomy conjecture. In: Proceedings of the 58th Annual Symposium on Foundations of Computer Science (FOCS 2017), pp. 331\u2013342. IEEE (2017)","DOI":"10.1109\/FOCS.2017.38"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75775-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T23:51:05Z","timestamp":1620777065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75775-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757748","9783030757755"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75775-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","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":"jelia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2021.aau.at\/","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 (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}