Mapping Semantic Networks to Undirected Networks

Simple item page
dc.creatorRodriguez, Marko A.
dc.date2008-04-02
dc.date.accessioned2026-07-07T12:07:59Z
dc.date.available2026-07-07T12:07:59Z
dc.descriptionThere exists an injective, information-preserving function that maps a semantic network (i.e a directed labeled network) to a directed network (i.e. a directed unlabeled network). The edge label in the semantic network is represented as a topological feature of the directed network. Also, there exists an injective function that maps a directed network to an undirected network (i.e. an undirected unlabeled network). The edge directionality in the directed network is represented as a topological feature of the undirected network. Through function composition, there exists an injective function that maps a semantic network to an undirected network. Thus, aside from space constraints, the semantic network construct does not have any modeling functionality that is not possible with either a directed or undirected network representation. Two proofs of this idea will be presented. The first is a proof of the aforementioned function composition concept. The second is a simpler proof involving an undirected binary encoding of a semantic network.
dc.identifierhttps://arxiv.org/abs/0804.0277
dc.identifierhttp://arxiv.org/abs/0804.0277
dc.identifierInternational Journal of Applied Mathematics and Computer Sciences, volume 5, issue 1, pages 39-42, ISSN:2070-3902, LA-UR-07-5287, 2009
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/209165
dc.subjectData Structures and Algorithms
dc.subjectF.2.2; F.4.1; E.1
dc.titleMapping Semantic Networks to Undirected Networks
dc.typetext

Files

Collections

arXiv