Property:HasReviewSummary
From Odp
This is a property of type Text.
(previous 25) (next 25)
Pages using the property "HasReviewSummary"
Showing 25 pages using this property.
J | |
|---|---|
| JoseEmilioLabraGayo about LicenseLinkedDataResources + | The authors propose a pattern to assert li … The authors propose a pattern to assert license issues based on n-ary relations between license, action, agent, resource and condition. The accompanying paper contains a more detailed introduction than the web page. Although the authors don't mention if the pattern has been employed in some real scenarios. has been employed in some real scenarios. |
K | |
| KarlHammar about LicenseLinkedDataResources + | The pattern as introduced and described in … The pattern as introduced and described in the associated WOP 2013 short description seems relevant, and reasonably constructed, with good reuse of existing schemas, and solving an important problem. Unfortunately however, the pattern as published here in the ODP portal is lacking in several key fields, making it difficult to understand. fields, making it difficult to understand. |
| KarlHammar about WOP2012TestPatterns + | This is a bad, bad pattern. Bad pattern! |
| KurtSandkuhl about Classification scheme - path enumeration model - to Taxonomy + | Path enumeration is a technique which is q … Path enumeration is a technique which is quite common in classification schemes. To support re-engineering of such schemes contributes to making them available for semantic applications, which makes the proposed ODP both very relevant and useful. The basic idea of the pattern and the proposed process are good and require only minor improvements (see detailed comments). But the preconditions for using the pattern and its limitations should be expressed more clearly. Not all existing implementations of the path enumeration scheme are as clean as the UN standards. Path enumeration is not only used with the subClassOf semantics, but also for instanceOf relations. This is mentioned in the description, but should be made more explicit: Please describe, which preconditions apply for using this pattern (for example: mutually exclusive concept groups, path constitutes unique identifier for concept groups, subClassOf relationship). An option in this context would be to extend the proposed pattern for cases, when some of the current preconditions do not apply (e.g. other relationships than subClassOf). Detailed comments: - the first step in the process description should be re-phrased (unclear wording; what does key value mean in this context?) - in the graphical representation: the start of a loop is represented in 2 different ways. Please check. - in “process example” (Example section) you should use the same numbering of the process steps as in the process description. Furthermore, you should also include the first step “identify the classification scheme items” in the example The pattern is suitable for presentation at WOP, but might not stimulate a long discussion as the proposed solution – in my opinion is not controversial. ion – in my opinion is not controversial. |
L | |
| LuigiIannone about OnlynessIsLoneliness (OIL) + | In order to avoid the confusion I would ra … In order to avoid the confusion I would rather describe the solution as the pattern, rather than the anti-pattern. Therefore, i would leave the motivation untouched but I'd reword the aim. Instead of describing the common mistake and its possible correction, I would start describing the situation, i.e.: a universal value restriction on a property that has, in fact, as its range the union of two disjunct classes. s range the union of two disjunct classes. |
| LuigiIannone about Partition + | The example could be more explanatory, maybe describing a real ontology situation rather than using letters. A scenario could be added too. |
| LuigiIannone about Partition 2 + | The example could be more explanatory, may … The example could be more explanatory, maybe describing a real ontology situation rather than using letters. A scenario could be added too. Although the pattern is a fundamental one, it is described in its simplest incarnation. There are more complicated forms of partitions, for instance including a hierarchy inside the partitions (see Spiciness in the Pizza Tutorial Ontology - http://www.co-ode.org/ontologies/pizza/2007/02/12/pizza.owl). This version is so lightweight that a live workshop discussion is superfluous. a live workshop discussion is superfluous. |
M | |
| MargheritaSini about PartOf + | This relationships may have many more specializations such as: - isPortionOf / hasPortion - compose / isComposedOf - isSpatiallyIncludedIn / spatiallyIncludes - isComponentOf / hasComponent |
| MariCarmenSuarezFigueroa about ConceptTerms + | The pattern try to represent linguistic information attached to a concept (concretelly, preferred term). |
| MariCarmenSuarezFigueroa about Enlarge Class Definition for Resolving Disjointness due to Subsomption + | It is not clear enough the motivation of this pattern. Indeed, in my opinion the example provided is not a good one (it seems strange to have a class called "Fauna-Flora"; what for me should be two different classes). |
| MariCarmenSuarezFigueroa about Enlarge Class Definition for Resolving Disjointness due to Subsomption 2 + | It is not clear enough the motivation of this pattern. Indeed, in my opinion the example provided is not a good one (it seems strange to have a class called "Fauna-Flora"; what for me should be two different classes). |
| MariCarmenSuarezFigueroa about Literal Reification + | The pattern represents how to express the reification of literal values in OWL. |
| MariCarmenSuarezFigueroa about Normalization + | The pattern provides a solution to represent multi-inheritance. |
| MariaPoveda about OOPMetrics + | The patterns describes numerical values (float and integer) for onject-oriented software metrics. The pattern is reusable and general enough. There are some revisions needed. |
| MariaPoveda about Template Instance + | This pattern's aim is to reduce the number of reified instances in an ontology for those cases where the reified properties are identical for multiple entities. |
| MariaPoveda about TransportPattern + | The goal of this pattern is modelling the … The goal of this pattern is modelling the movement of mass or energy from one place to another. Two competency questions are presented however the pattern does not seem to represent the information needed for answering them. Also, several fields are missing (e.g. scenarios, examples, related CPs) ng (e.g. scenarios, examples, related CPs) |
| MartaSabou about Partition + | This is a logical pattern that allows mode … This is a logical pattern that allows modeling partitions - i.e., a set of subclasses that are mutually disjoint but which jointly cover their parent class. I agree that this is a rather frequent modeling problem, and the proposed solution is likely to be helpful to many practitioners. Due to the fact that the proposed pattern is rather simple, it might not lead to very interesting/deep discussions during the WOP workshop, so my overall score reflects that. Additionally, the pattern could do with some further information in terms of usage scenarios and in particular its relation to other ODPs - this is such a core modeling problem I would be surprised if it was not already covered in some way by other patterns. The proposed solution uses the OWL2 constructs. Wouldn't it be more useful to give an "abstract" (KR language independent solution) and then illustrate its implementation both in OWL and OWLs? e its implementation both in OWL and OWLs? |
| MartaSabou about SynonymOrEquivalence (SOE) + | This is a simple but useful solution to an … This is a simple but useful solution to an antipattern - the tendency to declare two classes equivalent when in fact their labels simply express synonym. The pattern and the solution are quite simple, and as a result I do not expect this pattern to lead to lengthy and interesting discussions during the WOP workshop. Additionally, the pattern requires further documentation and more clear solutions (currently the solution link points to a whole directory and it is a rather tedious task to dig up the appropriate solution example) - these two facts forced me to lower my score to 0. wo facts forced me to lower my score to 0. |
| MartaSabou about Term-based thesaurus to lightweight ontology – record-based model + | This pattern describes the process of tran … This pattern describes the process of transforming a thesaurus type structure into an ontology and as such it has a considerable industrial impact. The pattern is clearly and extensively described and exemplified. Also, I think it will lead to interesting discussions during WOP, therefore my overall rating of 1. In the "ontology example" diagram, "learning" is both a subclass and a superclass of "competence" - based on the ETT example, skill <= competence. n the ETT example, skill <= competence. |
| MathieuDAquin about ConceptGroup + | This pattern, as far as I understand, to represents groups of concepts. I think the pattern would be interesting to discuss, but suffer from a number of problems as detailed below. |
| MathieuDAquin about DisjointnessOfComplement (DOC) + | I am not really sure what to do here. Wha … I am not really sure what to do here. What is proposed is an anti-pattern: a pattern which is sometimes used improperly and should, in these cases, be replaced by another. As far as I can tell, the portal is not intended to be used for such patterns. in addition, many elements are missing. It could be interesting to discuss anti-pattern and whether the proposed ones are good, what should be the description of such patterns, etc. be the description of such patterns, etc. |
| MathieuDAquin about Xsd:sequence embedding + | I don't really understand this pattern. It … I don't really understand this pattern. It seems to be representing the notion of sequence of objects, but focusing on the relation between the representation of sequence in XSD and the one in ontologies. My impression is that this pattern is more generic and that the link with XSD is only one possible usage of it. with XSD is only one possible usage of it. |
O | |
| OlafNoppens about Inverse n-ary relationship + | This pattern is an extension of the W3C n- … This pattern is an extension of the W3C n-ary relationship in that a n-ary realtionship can be summarized in a simple relationship between two individuals. I can image that querying a knowledge base is easier - however, I encourage the author to clarify and explain how this aim is achieved (give an example, etc.). However, there is one problem with the pattern and that's the name: the pattern does not describe an inverse n-ary relationship but a special kind of it where only two distinguished individuals are considered with "additional, and probably optional, argument". itional, and probably optional, argument". |
| OlafNoppens about Literal Reification + | The pattern states how to express reificat … The pattern states how to express reification of literal values in OWL by introducing an intermediate individual (type of Literal) which is connected (via hasLiteralValue) to a blank literal value, or via hasSameLiteralValue to another intermediate individual. I have two minor remarks (which depends on each other): (1) Literal is a subclass of (= 1 hasLiteralValue). I was wondering whether one could define literal equivalent to (= 1 hasLiteralValue or = 1 hasSameLiteralValue). The idea is that a literal has always either a literal value directly or indirectly (via hasSameLiteralValue) (2)SWRL rules are used (in that sense it would also be valid if Literal is defined equivalent to = 1 hasLiteralValue because the SWRL rules guarantee this behaviour). I suggest to add a remark to the description and also to the diagram. Because the application of the pattern assumes SWRL + OWL. ication of the pattern assumes SWRL + OWL. |
| OlafNoppens about Symmetric n-ary relationship + | The patterns tries to express a symmetric … The patterns tries to express a symmetric n-ary relationship, i.e., that an individual A is related to an individual B with some additional attributes, and that B is related to A with exactly the same attributes. As a matter of course, it can be modelled with a traditional n-ary relationship pattern - but the symmetry has to be modelled explicitly. The patterns tries to eliminate this kind of redundancy. However, it is not clear what the semantics of a "symmetric n-ary relationship" is. The use case (connection points and their distance) can't help because there are no n arguments. In that sense I understand it as a binary relationship with an additional attribute. The name "symmetric n-nary relationship" is misleading. But even then it is not clear how the symmetry is guaranteered with the equivalent axiom: It seems to be a special case of a n-ary relationship where two instantiations wrt. one property is demanded. tantiations wrt. one property is demanded. |
