Computing minimal mappings between Lightweight Ontologies

First Page		Document Content
Date: 2012-01-24 05:13:29 Semantic Web Ontology Information science Computing World Wide Web Consortium Minimal mappings Lightweight ontology Web Ontology Language B-tree Partially ordered set Maximal element Semantic matching		Computing minimal mappings between Lightweight Ontologies Add to Reading List Source URL: livingknowledge.europarchive.org Download Document from Source Website File Size: 299,36 KB Share Document on Facebook

	MEAN DIMENSION AND AN EMBEDDING PROBLEM: AN EXAMPLE ELON LINDENSTRAUSS, MASAKI TSUKAMOTO Abstract. For any positive integer D, we construct a minimal dynamical system with mean dimension equal to D/2 that cannot be embed DocID: 1r3TC - View Document
	Computing minimal mappings between Lightweight Ontologies DocID: 1qEN8 - View Document
	A curve and its abstract Jacobian Boris Zilber University of Oxford August 22, 2012 Abstract Let C(K) be the K-points of a smooth projective curve C of genus DocID: 1pYwf - View Document
	A Study in Empirical and ‘Casuistic’ Analysis of Ontology Mapping Results ˇ ab1 , Vojtˇech Sv´atek1 and Heiner Stuckenschmidt2 Ondˇrej Sv´ 1 DocID: 1pFau - View Document
	A Session-based Approach for Aligning Large Ontologies Patrick Lambrix1,2 and Rajaram Kaliyaperumal1 (1) Department of Computer and Information Science (2) Swedish e-Science Research Centre Link¨oping University, 581 83 DocID: 197pZ - View Document