Semantic Relation Type

From GM-RKB
Jump to: navigation, search

A Semantic Relation Type is a Type associated with a semantic relation.


2008

  • (Corbett, 2008) ⇒ Dan R. Corbett. (2008). “Graph-based Representation and Reasoning for Ontologies.” In: Studies in Computational Intelligence, Springer. [http://dx.doi.org/10.1007/978-3-540-78293-3 10.1007/978-3-540-78293-3 doi:[http://dx.doi.org/10.1007/978-3-540-78293-3 10.1007/978-3-540-78293-3)
    • QUOTE: A Conceptual Graph with respect to a canon is a tuple G=(C,R, type, referent, arg1, ..., argm), where
      • [math]C[/math] is the set of concepts ; type : [math]C[/math][math]T[/math] indicates the type of a concept, and referent : [math]C[/math] → $I$ indicates the referent marker of a concept.
      • [math]R[/math] is the set of conceptual relations, type : [math]R[/math][math]T[/math] indicates the type of relation, and each argi : [math]R[/math][math]C[/math] is a partial function where argi(r) indicates the i-th argument of the relation r. The argument functions are partial as they are undefined for arguments higher than the relation’s ‘arity’.We adopt the convention that arg0 indicates the (at most) one incoming arc. If there is no incoming arc to the relation, then arg0 is undefined. We also define the function arity(r) which returns an integer value representing the number of arguments that the relation [math]r[/math] has.