1. Subsumption in knowledge graphs
- Author
-
Mark Willems
- Subjects
Graph rewriting ,Theoretical computer science ,Hierarchy (mathematics) ,Semantics (computer science) ,Computer science ,Programming language ,computer.software_genre ,Rotation formalisms in three dimensions ,Differentiation rules ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS ,Computational semantics ,Conceptual graph ,Representation (mathematics) ,computer - Abstract
An important notion for representation formalisms of natural language semantics, is a subsumption hierarchy. Therefore a precise definition of subsumption is necessary. We shall argue that the usual solution of providing an extensional semantics and mapping subsumption onto set-inclusion, is not satisfactory. The problem is that extensions lose track of the structure. A better solution is used for conceptual graphs [13], where derivation rules define generalization.
- Published
- 2005
- Full Text
- View/download PDF