XSDL: Making XML Semantics Explicit [chapter]

Shengping Liu, Jing Mei, Anbu Yue, Zuoquan Lin
2005 Lecture Notes in Computer Science  
The problem that "XML formally governs syntax only -not semantics" has been a serious barrier for XML-based data integration and the extension of current Web to Semantic Web. To address this problem, we propose the XML Semantics Definition Language(XSDL) to express XML author's intended meaning and propose a model-theoretic semantics for XML. Consequently, XML becomes a sub-language of RDF in expressiveness and XML data can be semantics-preserving transformed into RDF data. We further discuss
more » ... e semantic entailment and validity of the XML documents. This work was supported by the National Natural Science Foundation of China under grant numbers 60373002 and 60496323. 1 This XML fragment is modified from examples in SWAD-Europe Deliverable 5.1: http://www.w3.org/2001/sw/Europe/reports/xml schema tools techniques report. there is datatype property definition:, then: dpn ∈ V DP , M ap (CtxP ath) ⊆ N (nodeT ype), where N (nodeT ype) = N e , if nodeType="element"; N a , if nodeType="attribute"; for each n ∈ M ap (CtxP ath), |M rp (n, DP ath)| = 1 or |M rp (n, RP ath)| = 1, i.e., for any context node n, there cannot be both more than one node in domain and range path; let the property's range is datatype d, for each m ∈ M rp (n, DP ath), and for each t ∈ M rp (n, RP ath), such that there is object property definition without reference: , then: opn ∈ V IP , M ap (CtxP ath) ⊆ N (nodeT ype), for each n ∈ M ap (CtxP ath), |M rp (n, DP ath)| = 1 or |M rp (n, RP ath)| = 1, for each m ∈ M rp (n, DP ath), and for each p ∈ M rp (n, RP ath), such that M o (< m, p >) =< M c (m), M c (p) >∈ ER(opn); 6. if there is object property definition with reference:, then: opn ∈ V IP , M ap (CtxP ath) ⊆ N (nodeT ype), for each n ∈ M ap (CtxP ath), |M rp (n, DP ath)| = 1 or |M rp (n, IDREF P ath)| = 1, for each m ∈ M rp (n, DP ath), and for each p ∈ M rp (n, IDREF P ath), there is one q ∈ M ap (IDP ath) with M c (p) = M c (q), then there is one k ∈ M rp (q, RP ath), such that M o (< m, k >) =< M c (m), M c (k) >∈ ER(opn).
doi:10.1007/978-3-540-31839-2_6 fatcat:ehjuwslnbnavpepa43kppn377a