{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:15:01Z","timestamp":1725484501924},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437604"},{"type":"electronic","value":"9783540480051"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48005-6_8","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T17:15:43Z","timestamp":1179594943000},"page":"69-83","source":"Crossref","is-referenced-by-count":12,"title":["A Formal Model for Topic Maps"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Auillans","sequence":"first","affiliation":[]},{"given":"Patrice Ossona","family":"de Mendez","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Rosenstiehl","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Vatant","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,29]]},"reference":[{"unstructured":"PMTM4, a processing model for XML Topic Maps, \n                    http:\/\/www.topicmaps.net\/pmtm4.htm\n                    \n                  , S. Newcomb and M. Biezunski (eds).","key":"8_CR1"},{"unstructured":"ISO\/IEC 13250 topic maps, \n                    http:\/\/www.y12.doe.gov\/sgml\/sc34\/document\/0129.pdf\n                    \n                  , 1999, (since decembre 2001, the DTD of XTM 1.0 is included within the ISO 13250 specification).","key":"8_CR2"},{"unstructured":"Resource Description Framework (RDF) model and syntax specification, \n                    http:\/\/www.w3.org\/TR\/REC-rdf-syntax\/\n                    \n                  , 1999, O. Lassila and R.R. Swick (eds).","key":"8_CR3"},{"unstructured":"Topic map foundational model requirements, \n                    http:\/\/www.y12.doe.gov\/sgml\/sc34\/document\/0266.htm\n                    \n                  , 2001, G. Moore and L.M. Garshol (eds).","key":"8_CR4"},{"unstructured":"XML Topic Maps (XTM) 1.0, \n                    http:\/\/www.topicmaps.org\/xtm\/1.0\/\n                    \n                  , 2001, S. Pepper and G. Moore (eds).","key":"8_CR5"},{"unstructured":"C. Berge, Sur certains hypergraphes g\u00e9n\u00e9ralisant les graphes bipartis, Combinatorial Theory and its Applications (A. R\u00e9nyi P. Erd\u00f6s and V.T. S\u00f6s, eds.), North-Holland, 1970, pp. 119\u2013133.","key":"8_CR6"},{"unstructured":"-, Graphes et hypergraphes, second ed., Dunod, Paris, 1973.","key":"8_CR7"},{"unstructured":"-, Hypergraphs, combinatorics of finite sets, North-Holland, 1989, (translation of Hypergraphes, Combinatoire des Ensembles Finis (Gauthier-Villars, Paris, 1987).","key":"8_CR8"},{"key":"8_CR9","first-page":"403","volume":"10","author":"R. Cori","year":"1992","unstructured":"R. Cori and A. Mach\u00ec, Maps, hypermaps and their automorphisms, Expo. Math. 10 (1992), 403\u2013467.","journal-title":"Expo. Math."},{"unstructured":"P. Duchet, Hypergraphs, Handbook of Combinatorics (R.L. Graham, M. Gr\u00f6tschel, and L. Lov\u00e1sz, eds.), vol. 1, Elsevier, 1995, pp. 381\u2013432.","key":"8_CR10"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P. Erd\u00f6s","year":"1966","unstructured":"P. Erd\u00f6s and A. Hajnal, On chromatic number of graphs and set-systems, Acta Math. Acad. Sci. Hungar. 17 (1966), 61\u201399.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"Z. F\u00fcredi","year":"1988","unstructured":"Z. F\u00fcredi, Matching and covers in hypergraphs, Graphs and Combinatorics 4 (1988), 115\u2013206.","journal-title":"Graphs and Combinatorics"},{"unstructured":"P. Hayes, RDF model theory, \n                    http:\/\/www.w3.org\/TR\/rdf-mt\/\n                    \n                  , 2001.","key":"8_CR13"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190110306","volume":"11","author":"D.S. Johnson","year":"1987","unstructured":"D.S. Johnson and H.O. Pollak, Hypergraph planarity and the complexity of drawing Venn diagrams, Journal of Graph Theory 11 (1987), 309\u2013325.","journal-title":"Journal of Graph Theory"},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1139\/p88-169","volume":"66","author":"W. Klonowski","year":"1989","unstructured":"W. Klonowski, Probabilistic-topological theory of systems with discrete intercations. I. system representation by a hypergraph, Can. J. Phys. 66 (1989), 1051\u20131060.","journal-title":"Can. J. Phys."},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1139\/p88-170","volume":"66","author":"W. Klonowski","year":"1989","unstructured":"-, Probabilistic-topological theory of systems with discrete intercations. II. calculation of the hypergraph probabilistic representation; the difference a posteriori algorithm, Can. J. Phys. 66 (1989), 1061\u20131067.","journal-title":"Can. J. Phys."},{"unstructured":"H. Laborit, La nouvelle grille, Laffont, 1974.","key":"8_CR17"},{"key":"8_CR18","volume-title":"Combinatorial problems and exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz, Combinatorial problems and exercises, Akad\u00e9miai Kiad\u00f3 \/North-Holland, 1979."},{"unstructured":"P. Ossona de Mendez, Representation of hypergraphs by contact of segments, Conf\u00e9rence Internationale \u201cGraphe et Combinatoire\u201d, 1995.","key":"8_CR19"},{"unstructured":"-, Combinatorial hypermaps vs topic maps, XML Europe 2001, 2001, \n                    http:\/\/www.gca.org\/papers\/xmleurope2001\/papers\/html\/s23-1.html\n                    \n                  .","key":"8_CR20"},{"unstructured":"H. Tonneau, The Pliant project, \n                    http:\/\/pliant.cx\n                    \n                  .","key":"8_CR21"},{"unstructured":"B. Vatant, SolSysTM, a solar system topic map, \n                    http:\/\/www.universimmedia.com\/topicmaps\/solsystm.xml\n                    \n                  .","key":"8_CR22"},{"issue":"B","key":"8_CR23","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0095-8956(75)90042-8","volume":"18","author":"T.R.S. Walsh","year":"1975","unstructured":"T.R.S. Walsh, Hypermaps versus bipartite maps, J. Combinatorial Theory 18(B) (1975), 155\u2013163.","journal-title":"J. Combinatorial Theory"},{"key":"8_CR24","first-page":"89","volume":"6","author":"A.A. Zykov","year":"1974","unstructured":"A.A. Zykov, Hypergraphs, Uspeki Mat. Nauk 6 (1974), 89\u2013154.","journal-title":"Uspeki Mat. Nauk"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2014 ISWC 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48005-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T14:47:41Z","timestamp":1550328461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48005-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437604","9783540480051"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-48005-6_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}