Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests

DOI10.46298/LMCS-20(1:16)2024MaRDI QIDQ6151565zbMATH OpenFDO

Authors Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche

Publication date 11 March 2024

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2212.03553v4

zbMATH Keywords

expressive powerschema languages

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• SHACL: a description logic in disguise
• A review of SHACL: from data validation to schema reasoning for RDF graphs
• Complexity and Expressiveness of ShEx for RDF
• Fixpoint semantics for recursive \textsc{shacl}
• Constraints in RDF

Cites work

• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• An introduction to description logic
• Domain independence and the relational calculus
• Expressiveness of SHACL features

Cited in

(1)

• Fixpoint semantics for recursive \textsc{shacl}

This page was built for publication: Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151565)