ShEx
E664417
ShEx (Shape Expressions) is a concise, formal language for describing and validating the structure of RDF data graphs.
All labels observed (1)
| Label | Occurrences |
|---|---|
| ShEx canonical | 2 |
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
RDF validation language
ⓘ
constraint language ⓘ shape expression language ⓘ |
| alternativeTo | SHACL NERFINISHED ⓘ |
| appliesTo |
API input validation for RDF-based systems
ⓘ
RDF data validation ⓘ data quality checking ⓘ schema-driven RDF data design ⓘ |
| comparedWith | SHACL NERFINISHED ⓘ |
| describes | RDF graph structure ⓘ |
| domain |
Linked Data
NERFINISHED
ⓘ
Semantic Web NERFINISHED ⓘ |
| fullName | Shape Expressions NERFINISHED ⓘ |
| hasAbbreviation | ShEx NERFINISHED ⓘ |
| hasConcept |
node constraint
ⓘ
shape ⓘ shape map ⓘ triple constraint ⓘ value class ⓘ |
| hasFeature |
annotations on shapes and triple constraints
ⓘ
closed and open shapes ⓘ concise syntax ⓘ formal semantics ⓘ human-readable syntax ⓘ imports of external schemas ⓘ support for RDF node constraints ⓘ support for cardinality constraints ⓘ support for grouping and choice of properties ⓘ support for negation of shapes ⓘ support for recursion ⓘ support for value constraints ⓘ |
| hasSerialization |
ShExC
NERFINISHED
ⓘ
ShExJ NERFINISHED ⓘ ShExR NERFINISHED ⓘ |
| supports |
RDF IRIs
ⓘ
RDF blank nodes ⓘ RDF datatypes ⓘ RDF literals ⓘ RDF node kinds ⓘ regular-expression-like expressions over triples ⓘ shape references ⓘ value sets ⓘ |
| syntaxStyle |
JSON-based syntax
ⓘ
RDF-based syntax ⓘ compact text syntax ⓘ |
| usedFor |
defining constraints on RDF data
ⓘ
validating RDF data graphs ⓘ |
| usedIn |
Wikidata data modeling
ⓘ
knowledge graph validation ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: ShEx Description of subject: ShEx (Shape Expressions) is a concise, formal language for describing and validating the structure of RDF data graphs.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.