Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
Saved in:
| Published in: | Logical Methods in Computer Science |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2024
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
- Disjoint-union partial algebras
- An extensible equality checking algorithm for dependent type theories
- Full abstraction for fair testing in CCS (expanded version)
- Expressivity of AuDaLa: Turing Completeness and Possible Extensions
- Static Analysis of Recursive SHACL
- Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion