{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:57:01Z","timestamp":1761897421970,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030624187"},{"type":"electronic","value":"9783030624194"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-62419-4_27","type":"book-chapter","created":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T17:13:40Z","timestamp":1604164420000},"page":"474-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["SHACL Satisfiability and Containment"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2502-0011","authenticated-orcid":false,"given":"Paolo","family":"Pareti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3962-9303","authenticated-orcid":false,"given":"George","family":"Konstantinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5140-5783","authenticated-orcid":false,"given":"Fabio","family":"Mogavero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6387-4034","authenticated-orcid":false,"given":"Timothy J.","family":"Norman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,1]]},"reference":[{"key":"27_CR1","unstructured":"Amarilli, A., Benedikt, M., Bourhis, P., Vanden Boom, M.: Query answering with transitive and linear-ordered data. In: IJCAI 2016, pp. 893\u2013899 (2016)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Acar, E., Benerecetti, M., Mogavero, F.: Satisfiability in strategy logic can be easier than model checking. In: AAAI 2019, pp. 2638\u20132645 (2019)","DOI":"10.1609\/aaai.v33i01.33012638"},{"key":"27_CR3","volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","author":"F Baader","year":"2003","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardim, D., Patel-Scheider, P.: The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"27_CR4","first-page":"1","volume":"66","author":"R Berger","year":"1966","unstructured":"Berger, R.: The undecidability of the domino problem. MAMS 66, 1\u201372 (1966)","journal-title":"MAMS"},{"key":"27_CR5","unstructured":"ten Cate, B., Segoufin, L.: Unary negation. In: STACS 2011, pp. 344\u2013355. LIPIcs 9, Leibniz-Zentrum fuer Informatik (2011)"},{"issue":"3","key":"27_CR6","first-page":"1","volume":"9","author":"B ten Cate","year":"2013","unstructured":"ten Cate, B., Segoufin, L.: Unary negation. LMCS 9(3), 1\u201346 (2013)","journal-title":"LMCS"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-030-30793-6_9","volume-title":"The Semantic Web \u2013 ISWC 2019","author":"J Corman","year":"2019","unstructured":"Corman, J., Florenzano, F., Reutter, J.L., Savkovi\u0107, O.: Validating SHACL constraints over a sparql endpoint. In: Ghidini, C., et al. (eds.) ISWC 2019. LNCS, vol. 11778, pp. 145\u2013163. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30793-6_9"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-030-00671-6_19","volume-title":"The Semantic Web \u2013 ISWC 2018","author":"J Corman","year":"2018","unstructured":"Corman, J., Reutter, J.L., Savkovi\u0107, O.: Semantics and validation of recursive SHACL. In: Vrande\u010di\u0107, D., et al. (eds.) ISWC 2018. LNCS, vol. 11136, pp. 318\u2013336. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00671-6_19"},{"key":"27_CR9","unstructured":"Cyganiak, R., Wood, D., Markus Lanthaler, G.: RDF 1.1 concepts and abstract syntax. W3C Recommendation, W3C (2014). http:\/\/www.w3.org\/TR\/2014\/REC-rdf11-concepts-20140225\/"},{"key":"27_CR10","unstructured":"Danielski, D., Kieronski, E.: Finite satisfiability of unary negation fragment with transitivity. In: MFCS 2019, pp. 17:1\u201315. LIPIcs 138, Leibniz-Zentrum fuer Informatik (2019)"},{"issue":"1","key":"27_CR11","first-page":"87","volume":"124","author":"F Donini","year":"2000","unstructured":"Donini, F., Massacci, F.: ExpTime tableaux for $$\\cal{ALC}$$. AI 124(1), 87\u2013138 (2000)","journal-title":"AI"},{"issue":"4","key":"27_CR12","first-page":"1719","volume":"64","author":"E Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E.: On the restraining power of guards. JSL 64(4), 1719\u20131742 (1999)","journal-title":"JSL"},{"issue":"1","key":"27_CR13","first-page":"53","volume":"3","author":"E Gr\u00e4del","year":"1997","unstructured":"Gr\u00e4del, E., Kolaitis, P., Vardi, M.: On the decision problem for two-variable first-order logic. BSL 3(1), 53\u201369 (1997)","journal-title":"BSL"},{"key":"27_CR14","unstructured":"Gr\u00e4del, E., Otto, M., Rosen, E.: Two-variable logic with counting is decidable. In: LICS 1997, pp. 306\u2013317. IEEECS (1997)"},{"key":"27_CR15","unstructured":"Jung, J., Lutz, C., Martel, M., Schneider, T.: Querying the unary negation fragment with regular path expressions. In: ICDT 2018, pp. 15:1\u201315:18. OpenProceedings.org (2018)"},{"key":"27_CR16","unstructured":"Knublauch, H., Kontokostas, D.: Shapes constraint language (SHACL). W3C Recommendation, W3C (2017). https:\/\/www.w3.org\/TR\/shacl\/"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Leinberger, M., Seifer, P., Rienstra, T., L\u00e4mmel, R., Staab, S.: Deciding SHACL shape containment through description logics reasoning. In: Pan, J.Z., et al. (eds.) The Semantic Web - ISWC 2020, vol. 12506, pp. 366\u2013383. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-62419-4_21"},{"key":"27_CR18","unstructured":"Lutz, C.: An Improved NExpTime-Hardness Result for Description Logic $$\\cal{ALC}$$ Extended with Inverse Roles, Nominals, and Counting. Technical Report, 05\u201305. Dresden University of Technology, Dresden, Germany (2005)"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/malq.19750210118","volume":"21","author":"M Mortimer","year":"1975","unstructured":"Mortimer, M.: On languages with two variables. MLQ 21(1), 135\u2013140 (1975)","journal-title":"MLQ"},{"issue":"3","key":"27_CR20","first-page":"369","volume":"14","author":"I Pratt-Hartmann","year":"2005","unstructured":"Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. JLLI 14(3), 369\u2013395 (2005)","journal-title":"JLLI"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-13824-9_4","volume-title":"Logic, Language, Information and Computation","author":"I Pratt-Hartmann","year":"2010","unstructured":"Pratt-Hartmann, I.: The two-variable fragment with counting revisited. In: Dawar, A., de Queiroz, R. (eds.) WoLLIC 2010. LNCS (LNAI), vol. 6188, pp. 42\u201354. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13824-9_4"},{"key":"27_CR22","first-page":"177","volume":"12","author":"R Robinson","year":"1971","unstructured":"Robinson, R.: Undecidability and nonperiodicity for tilings of the plane. IM 12, 177\u2013209 (1971)","journal-title":"IM"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-45744-5_7","volume-title":"Automated Reasoning","author":"U Sattler","year":"2001","unstructured":"Sattler, U., Vardi, M.Y.: The hybrid $$\\mu $$-calculus. In: Gor\u00e9, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 76\u201391. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45744-5_7"},{"key":"27_CR24","unstructured":"Schild, K.: A correspondence theory for terminological logics: preliminary report. In: IJCAI 1991, pp. 466\u2013471 (1991)"},{"key":"27_CR25","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1613\/jair.705","volume":"12","author":"S Tobies","year":"2000","unstructured":"Tobies, S.: The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. JAIR 12, 199\u2013217 (2000)","journal-title":"JAIR"},{"key":"27_CR26","first-page":"1","volume":"40","author":"H Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition II. BSTJ 40, 1\u201341 (1961)","journal-title":"BSTJ"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62419-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T23:03:30Z","timestamp":1761865410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62419-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030624187","9783030624194"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62419-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semweb2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2020.semanticweb.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind for the Research Track; single-blind for the Resources and In-use Track","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":"287","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":"81","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":"0","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":"28% - 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-4","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-7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","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)"}}]}}