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

DOI10.46298/LMCS-20(1:16)2024arXiv2212.03553v4MaRDI QIDQ6151565FDOQ6151565

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)

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

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

zbMATH Keywords

expressive powerschema languages

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Domain independence and the relational calculus
• An introduction to description logic
• 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)