1 February 2013 in Journal of Computers
The extensible markup language (XML), a standard format of web information, has a clear syntax but unfortunately an ambiguous formal semantics, which results in being not used directly in semantic web applications. So it is tough job to reuse XML-based data intelligently in the semantic web. To address this problem, a new formal technique of obtaining ontology data automatically from XML documents is proposed. We provide the XML a semantical interpretation by developing a graph-based formal language, which then can be automatically mapped into web ontology language OWL with semantics preserved. The semantic validity and entailment problem are also concerned. The automatical mapping tool has also been developed.
29 July 2025 in Neural Processing Letters
Relation prediction in knowledge graphs is a classic task. However, predicting unseen facts under the open-world assumption remains challenging, as conventional closure reasoning methods tend to fail. To address this, we propose an uncertain knowledge graph embedding and Bayesian inferring model, UKGEBN, which examines the capabilities of approximate inference under the open-world assumption. This model employs a large language model to encode entities and relations by treating facts as natural language sentences. It then learns knowledge confidence through a recurrent neural network and subsequently constructs Bayesian networks for the uncertain knowledge graph based on the learned confidence. The constructed Bayesian network can reasonably infer unseen knowledge facts, even if the elements of these facts-such as new entities and relationships-have never been encountered in the knowledge base before. The experimental results show that the new model has improved the MSE metric by 24.6% in relation prediction on the benchmark dataset. Case studies indicate that the model significantly enhances the revelation of latent semantic information, facilitating the prediction of implicit relationships in uncertain knowledge graphs.
15 April 2014 in Journal of Applied Mathematics
Semantic collision is inevitable while building a domain ontology from heterogeneous data sources (semi-)automatically. Therefore, the semantic consistency is indispensable precondition for building a correct ontology. In this paper, a model-checking-based method is proposed to handle the semantic consistency problem with a kind of middle-model methodology, which could extract a domain ontology from structured and semistructured data sources semiautomatically. The method translates the middle model into the Kripke structure, and consistency assertions into CTL formulae, so a consistency checking problem is promoted to a global model checking. Moreover, the feasibility and correctness of the transformation is proved, and case studies are provided.
1 January 2013 in Lecture Notes in Computer Science