{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:20Z","timestamp":1753894400719,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>SHACL is a W3C-proposed schema language for expressing structural constraints\non RDF graphs. Recent work on formalizing this language has revealed a striking\nrelationship to description logics. SHACL expressions can use three fundamental\nfeatures that are not so common in description logics. These features are\nequality tests; disjointness tests; and closure constraints. Moreover, SHACL is\npeculiar in allowing only a restricted form of expressions (so-called targets)\non the left-hand side of inclusion constraints.\n  The goal of this paper is to obtain a clear picture of the impact and\nexpressiveness of these features and restrictions. We show that each of the\nfour features is primitive: using the feature, one can express boolean queries\nthat are not expressible without using the feature. We also show that the\nrestriction that SHACL imposes on allowed targets is inessential, as long as\nclosure constraints are not used.\n  In addition, we show that enriching SHACL with \"full\" versions of equality\ntests, or disjointness tests, results in a strictly more powerful language.<\/jats:p>","DOI":"10.46298\/lmcs-20(1:16)2024","type":"journal-article","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T11:50:06Z","timestamp":1709121006000},"source":"Crossref","is-referenced-by-count":1,"title":["Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests"],"prefix":"10.46298","volume":"Volume 20, Issue 1","author":[{"given":"Bart","family":"Bogaerts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Jakubowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Van den","family":"Bussche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2024,2,28]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/13143\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/13143\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T11:50:06Z","timestamp":1709121006000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,28]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(1:16)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2212.03553v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2212.03553v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2212.03553","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2212.03553","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2024,2,28]]},"article-number":"10442"}}