--
You received this message because you are subscribed to the Google Group "TopBraid Suite Users", the topics of which include Enterprise Vocabulary Network (EVN), Reference Data Manager (RDM), TopBraid Composer, TopBraid Live, TopBraid Insight, SPARQLMotion, SPARQL Web Pages and SPIN.
To post to this group, send email to topbrai...@googlegroups.com
---
You received this message because you are subscribed to the Google Groups "TopBraid Suite Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to topbraid-user...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
< First, you need to realize that the kind of constraint check you are looking for is not covered in standard SWP-based reasoners because they assume an open world. I.e. you cannot use cardinality to check consistency because there isn't a way to know if all known properties are being included.>
Scott meant in the standard OWL-based reasoners.
Open world assumption used in RDFS and OWL means that being below of min cardinality or below exact cardinality will never raise a violation because it is assumed that we don’t have all the data. Further, being above max cardinality or above exact cardinality will not necessarily raise a violation either because different values may represent the same resource.
One can use SPIN to operate under a more common (and typically more useful) closed world assumption for data constrains checking.
Regards,
Irene