{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T05:05:34Z","timestamp":1764047134942,"version":"3.41.2"},"reference-count":23,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T00:00:00Z","timestamp":1660780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["DTA"],"published-print":{"date-parts":[[2023,4,25]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>The curation of ontologies and knowledge graphs (KGs) is an essential task for industrial knowledge-based applications, as they rely on the contained knowledge to be correct and error-free. Often, a significant amount of a KG is curated by humans. Established validation methods, such as Shapes Constraint Language, Shape Expressions or Web Ontology Language, can detect wrong statements only after their materialization, which can be too late. Instead, an approach that avoids errors and adequately supports users is required.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>For solving that problem, Property Assertion Constraints (PACs) have been developed. PACs extend the range definition of a property with additional logic expressed with SPARQL. For the context of a given instance and property, a tailored PAC query is dynamically built and triggered on the KG. It can determine all values that will result in valid property value assertions.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>PACs can avoid the expansion of KGs with invalid property value assertions effectively, as their contained expertise narrows down the valid options a user can choose from. This simplifies the knowledge curation and, most notably, relieves users or machines from knowing and applying this expertise, but instead enables a computer to take care of it.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>PACs are fundamentally different from existing approaches. Instead of detecting erroneous materialized facts, they can determine all semantically correct assertions before materializing them. This avoids invalid property value assertions and provides users an informed, purposeful assistance. To the author's knowledge, PACs are the only such approach.<\/jats:p><\/jats:sec>","DOI":"10.1108\/dta-05-2022-0209","type":"journal-article","created":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T09:19:59Z","timestamp":1660814399000},"page":"157-176","source":"Crossref","is-referenced-by-count":1,"title":["Property Assertion Constraints for ontologies and knowledge graphs"],"prefix":"10.1108","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9672-2387","authenticated-orcid":false,"given":"Henrik","family":"Dibowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2022,8,18]]},"reference":[{"key":"key2023062207404189200_ref001","unstructured":"Clark & Parsia LLC (2021), \u201cValidation constraints. The Stardog manual\u201d, available at: http:\/\/stage.docs.stardog.com.s3-website-us-east-1.amazonaws.com\/2.2.4\/#_validating_constraints (accessed 11 May 2022)."},{"key":"key2023062207404189200_ref002","unstructured":"Das, S., Sundara, S. and Cyganiak, R. (2012), \u201cR2RML: RDB to RDF mapping language\u201d, W3C Recommendation, available at: www.w3.org\/TR\/r2rml\/ (accessed 4 July 2022)."},{"first-page":"234","article-title":"Property assertion constraints for an informed, error-preventing expansion of knowledge graphs","year":"2021","key":"key2023062207404189200_ref003"},{"first-page":"41","article-title":"Using knowledge graphs to manage a data lake","year":"2021","key":"key2023062207404189200_ref004"},{"first-page":"65","article-title":"Using semantic technologies to manage a data lake: data catalog, provenance and access control","year":"2020","key":"key2023062207404189200_ref005"},{"key":"key2023062207404189200_ref006","unstructured":"Feigenbaum, L., Williams, G.T., Clark, K.G. and Torres, E. (2013), \u201cSPARQL 1.1 protocol\u201d, W3C Recommendation, available at: www.w3.org\/TR\/sparql11-protocol\/ (accessed 11 May 2022)."},{"year":"2015","key":"key2023062207404189200_ref007","article-title":"RDF constraint checking"},{"key":"key2023062207404189200_ref008","unstructured":"Huaman, E., K\u00e4rle, E. and Fensel, D. (2020), \u201cKnowledge graph validation\u201d, arXiv:2005.01389, available at: https:\/\/arxiv.org\/abs\/2005.01389 (accessed 11 May 2022)."},{"first-page":"497","article-title":"Reasoning with noisy semantic data","year":"2011","key":"key2023062207404189200_ref009"},{"key":"key2023062207404189200_ref010","unstructured":"Knublauch, H., Hendler, J.A. and Idehen, K. (2011), \u201cSPIN \u2013 overview and motivation\u201d, W3C Member Submission, available at: www.w3.org\/Submission\/spin-overview\/ (accessed 11 May 2022)."},{"key":"key2023062207404189200_ref011","unstructured":"Knublauch, H. and Kontokostas, D. (2017), \u201cShapes constraint language (SHACL)\u201d, W3C Recommendation, available at: www.w3.org\/TR\/shacl\/ (accessed 11 May 2022)."},{"key":"key2023062207404189200_ref012","unstructured":"Meester, B., Heyvaert, P. and Delva, T. (2020), \u201cRDF mapping language (RML)\u201d, Unofficial Draft, available at: https:\/\/rml.io\/specs\/rml\/ (accessed 4 July 2022)."},{"issue":"5","key":"key2023062207404189200_ref013","doi-asserted-by":"crossref","first-page":"801","DOI":"10.3233\/SW-200369","article-title":"Automatic detection of relation assertion errors and induction of relation constraints","volume":"11","year":"2020","journal-title":"Semantic Web"},{"first-page":"1","article-title":"Detection of relation assertion errors in knowledge graphs","year":"2017","key":"key2023062207404189200_ref014"},{"issue":"3","key":"key2023062207404189200_ref015","doi-asserted-by":"crossref","first-page":"489","DOI":"10.3233\/SW-160218","article-title":"Knowledge graph refinement: a survey of approaches and evaluation methods","volume":"8","year":"2016","journal-title":"Semantic Web"},{"issue":"1","key":"key2023062207404189200_ref016","first-page":"45","article-title":"Can we ever catch up with the web?","volume":"1","year":"2010","journal-title":"Semantic Web"},{"key":"key2023062207404189200_ref017","unstructured":"Prud'hommeaux, E., Boneva, I., Gayo, J.E.L. and Kellogg, G. (2019), \u201cShape expressions language 2.1 (ShEx). Final community group report 8\u201d, available at: http:\/\/shex.io\/shex-semantics\/ (accessed 11 May 2022)."},{"first-page":"1549","article-title":"OSLC resource shape: a language for defining constraints on linked data","year":"2013","key":"key2023062207404189200_ref018"},{"key":"key2023062207404189200_ref019","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.knosys.2016.04.015","article-title":"Discriminative predicate path mining for fact checking in knowledge graphs","volume":"104","year":"2016","journal-title":"Knowledge-Based Systems"},{"first-page":"859","article-title":"Finding streams in knowledge graphs to support fact checking","year":"2017","key":"key2023062207404189200_ref020"},{"first-page":"630","article-title":"Unsupervised discovery of corroborative paths for fact validation","year":"2019","key":"key2023062207404189200_ref021"},{"first-page":"37","article-title":"An extensible framework for verification of numerical claims","year":"2017","key":"key2023062207404189200_ref022"},{"first-page":"504","article-title":"Detecting incorrect numerical data in DBpedia","year":"2014","key":"key2023062207404189200_ref023"}],"container-title":["Data Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-05-2022-0209\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-05-2022-0209\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:15:09Z","timestamp":1753398909000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/dta\/article\/57\/2\/157-176\/19258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,18]]},"references-count":23,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,8,18]]},"published-print":{"date-parts":[[2023,4,25]]}},"alternative-id":["10.1108\/DTA-05-2022-0209"],"URL":"https:\/\/doi.org\/10.1108\/dta-05-2022-0209","relation":{},"ISSN":["2514-9288","2514-9288"],"issn-type":[{"type":"print","value":"2514-9288"},{"type":"electronic","value":"2514-9288"}],"subject":[],"published":{"date-parts":[[2022,8,18]]}}}