The differences between OWL and SHACL are presented in the table below.
OWL |
SHACL |
Based on open world assumption |
Based on closed world assumption |
Designed for inferencing |
Designed for validation |
Computationally cheap (typical problems are decidable) |
? |
A lot of inferences almost "out of the box" |
One have to define a lot of constraints manually |
Is useful as documentation for RDF |
|
As to cardinality constraints in OWL, these constraints allow to close the world in some respects in some cases, in order to get additional inferences.
The logic of cardinality constraints is opposite in OWL and in SHACL. Informally:
In SHACL,
ex:PersonShape
a sh:NodeShape ;
sh:targetClass ex:Person ;
sh:path ex:parent ;
sh:minCount 1 .`
means that if somebody is a person, then he/she has to have at least one parent.
In OWL,
ex:Person owl:equivalentClass [ rdf:type owl:Restriction ;
owl:onProperty ex:parent ;
owl:minCardinality "1" ] . `
means that if somebody has at least one parent, then he/she is a person.
From TopBraid marketing materials:
How is SHACL different from RDF Schema and OWL? RDFS and OWL were designed for an “Open World” in which data may be assembled from many places on the Semantic Web. This design goal has caused a lot of frustration over the years, because it made it impossible to check even the most obvious integrity constraints, such as whether a property has a certain number of values. In contrast, SHACL assumes a “Closed World”, aligning with the expectations of typical business users. Furthermore, OWL has been optimized for a certain type of classification problems, yet it could not be used to do routine operations necessary for data validation such as mathematical computations or text operations. SHACL is much more expressive. Further it seamlessly integrates with SPARQL to express almost arbitrary conditions. BTW it is perfectly fine to incrementally extend an RDFS or OWL model with SHACL statements, supporting both worlds.
See also: http://spinrdf.org/shacl-and-owl.html
A EquivalentTo p min 2
and an individual x withx p y1
andx p y2
and ` y1 differentFrom y2` you could infer thatx
belongs to classA
– Bookbinding