Songmao Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Songmao Zhang has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Olivier Bodenreider
National Library of Medicine
7 shared publications - Anshu Xiong
Chinese Academy of Sciences
4 shared publications - Guilin Qi
Southeast University, Nanjing, China
3 shared publications - Weizhuo Li
Nanjing University of Posts and Telecommunications
3 shared publications - Christine Golbreich
LIM, University Rennes 1, 35043 Rennes, France
2 shared publications - Huan Zhang
Key Laboratory of MADIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences
2 shared publications
Latest Publications
- 24 September 2025
- Published by Springer Nature
- p. 437-451
Recognizing the Impact Among Relevant Elements for Reaching Stability in Incomplete Argumentation Frameworks
- 24 September 2025
- Published by Springer Nature
- p. 437-451
Recognizing the Impact Among Relevant Elements for Reaching Stability in Incomplete Argumentation Frameworks
- 11 June 2025
- Published by Springer Nature
- p. 343-360
Relevance for Stability of Verification Status of a Set of Arguments in Incomplete Argumentation Frameworks
- 11 June 2025
- Published by Springer Nature
- p. 343-360
Relevance for Stability of Verification Status of a Set of Arguments in Incomplete Argumentation Frameworks
- Open Access
Relevance for Stability of Verification Status of a Set of Arguments in Incomplete Argumentation Frameworks (with Proofs)
The notion of relevance was proposed for stability of justification status of a single argument in incomplete argumentation frameworks (IAFs) in 2024 by Odekerken et al. To extend the notion, we study the relevance for stability of verification status of a set of arguments in this paper, i.e., the uncertainties in an IAF that have to be resolved in some situations so that answering whether a given set of arguments is an extension obtains the same result in every completion of the IAF. Further we propose the notion of strong relevance for describing the necessity of resolution in all situations reaching stability. An analysis of complexity reveals that detecting the (strong) relevance for stability of sets of arguments can be accomplished in P time under the most semantics discussed in the paper. We also discuss the difficulty in finding tractable methods for relevance detection under grounded semantics.
Open AccessRelevance for Stability of Verification Status of a Set of Arguments in Incomplete Argumentation Frameworks (with Proofs)
The notion of relevance was proposed for stability of justification status of a single argument in incomplete argumentation frameworks (IAFs) in 2024 by Odekerken et al. To extend the notion, we study the relevance for stability of verification status of a set of arguments in this paper, i.e., the uncertainties in an IAF that have to be resolved in some situations so that answering whether a given set of arguments is an extension obtains the same result in every completion of the IAF. Further we propose the notion of strong relevance for describing the necessity of resolution in all situations reaching stability. An analysis of complexity reveals that detecting the (strong) relevance for stability of sets of arguments can be accomplished in P time under the most semantics discussed in the paper. We also discuss the difficulty in finding tractable methods for relevance detection under grounded semantics.
- 12 November 2024
- Published by Springer Nature
- p. 470-485
Stability of Extensions in Incomplete Argumentation Frameworks
- 12 November 2024
- Published by Springer Nature
- p. 470-485
Stability of Extensions in Incomplete Argumentation Frameworks
- 12 November 2022
- Published by Springer Nature
- p. 659-668
Identifying Necessary and Sufficient Conditions for the Enforcement Problem of Argumentation Frameworks
- 12 November 2022
- Published by Springer Nature
- p. 659-668
Identifying Necessary and Sufficient Conditions for the Enforcement Problem of Argumentation Frameworks
- 23 August 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 211
A graph-based method for interactive mapping revision in DL-Lite
- 23 August 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 211
A graph-based method for interactive mapping revision in DL-Lite
- 9 December 2018
- Published by Springer Nature
- p. 236-250
Augmenting Embedding with Domain Knowledge for Oral Disease Diagnosis Prediction
- 9 December 2018
- Published by Springer Nature
- p. 236-250
Augmenting Embedding with Domain Knowledge for Oral Disease Diagnosis Prediction
- 14 November 2018
- Published by Springer Nature
- p. 244-261
A Graph-Based Method for Interactive Mapping Revision
- 14 November 2018
- Published by Springer Nature
- p. 244-261
A Graph-Based Method for Interactive Mapping Revision
- 23 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 31 (9) , 1630-1644
A Study on Big Knowledge and Its Engineering Issues
After entering the big data era, a new term of ‘big knowledge’ has been coined to deal with challenges in mining a mass of knowledge from big data. While researchers used to explore the basic characteristics of big data, we have not seen any studies on the general and essential properties of big knowledge. To fill this gap, this paper studies the concepts of big knowledge, big-knowledge system and big-knowledge engineering. Ten massiveness characteristics for big knowledge and big-knowledge systems, including massive concepts, connectedness, clean data resources, cases, confidence, capabilities, cumulativeness, concerns, consistency and completeness, are defined and explored. Based on these characteristics, a comprehensive investigation is conducted on some large-scale knowledge engineering projects. We also investigate the recent research efforts on knowledge graphs, where they are analyzed to determine which ones can be considered as big knowledge and big-knowledge system. Further, a definition of big-knowledge engineering and its life cycle paradigm is presented. All these projects are accordingly checked to determine whether they belong to big-knowledge engineering projects. Finally, the perspectives of big knowledge research are discussed.
- 23 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 31 (9) , 1630-1644
A Study on Big Knowledge and Its Engineering Issues
After entering the big data era, a new term of ‘big knowledge’ has been coined to deal with challenges in mining a mass of knowledge from big data. While researchers used to explore the basic characteristics of big data, we have not seen any studies on the general and essential properties of big knowledge. To fill this gap, this paper studies the concepts of big knowledge, big-knowledge system and big-knowledge engineering. Ten massiveness characteristics for big knowledge and big-knowledge systems, including massive concepts, connectedness, clean data resources, cases, confidence, capabilities, cumulativeness, concerns, consistency and completeness, are defined and explored. Based on these characteristics, a comprehensive investigation is conducted on some large-scale knowledge engineering projects. We also investigate the recent research efforts on knowledge graphs, where they are analyzed to determine which ones can be considered as big knowledge and big-knowledge system. Further, a definition of big-knowledge engineering and its life cycle paradigm is presented. All these projects are accordingly checked to determine whether they belong to big-knowledge engineering projects. Finally, the perspectives of big knowledge research are discussed.
- Open Access
- 19 March 2018
- Published by Springer Nature in Journal of Biomedical Semantics
- Vol. 9 (1) , 1-27
Matching biomedical ontologies based on formal concept analysis
Background: The goal of ontology matching is to identify correspondences between entities from different yet overlapping ontologies so as to facilitate semantic integration, reuse and interoperability. As a well developed mathematical model for analyzing individuals and structuring concepts, Formal Concept Analysis (FCA) has been applied to ontology matching (OM) tasks since the beginning of OM research, whereas ontological knowledge exploited in FCA-based methods is limited. This motivates the study in this paper, i.e., to empower FCA with as much as ontological knowledge as possible for identifying mappings across ontologies. Methods: We propose a method based on Formal Concept Analysis to identify and validate mappings across ontologies, including one-to-one mappings, complex mappings and correspondences between object properties. Our method, called FCA-Map, incrementally generates a total of five types of formal contexts and extracts mappings from the lattices derived. First, the token-based formal context describes how class names, labels and synonyms share lexical tokens, leading to lexical mappings (anchors) across ontologies. Second, the relation-based formal context describes how classes are in taxonomic, partonomic and disjoint relationships with the anchors, leading to positive and negative structural evidence for validating the lexical matching. Third, the positive relation-based context can be used to discover structural mappings. Afterwards, the property-based formal context describes how object properties are used in axioms to connect anchor classes across ontologies, leading to property mappings. Last, the restriction-based formal context describes co-occurrence of classes across ontologies in anonymous ancestors of anchors, from which extended structural mappings and complex mappings can be identified. Results: Evaluation on the Anatomy, the Large Biomedical Ontologies, and the Disease and Phenotype track of the 2016 Ontology Alignment Evaluation Initiative campaign demonstrates the effectiveness of FCA-Map and its competitiveness with the top-ranked systems. FCA-Map can achieve a better balance between precision and recall for large-scale domain ontologies through constructing multiple FCA structures, whereas it performs unsatisfactorily for smaller-sized ontologies with less lexical and semantic expressions. Conclusions: Compared with other FCA-based OM systems, the study in this paper is more comprehensive as an attempt to push the envelope of the Formal Concept Analysis formalism in ontology matching tasks. Five types of formal contexts are constructed incrementally, and their derived concept lattices are used to cluster the commonalities among classes at lexical and structural level, respectively. Experiments on large, real-world domain ontologies show promising results and reveal the power of FCA.
- 19 March 2018
- Published by Springer Nature in Journal of Biomedical Semantics
- Vol. 9 (1) , 1-27
Open AccessMatching biomedical ontologies based on formal concept analysis
Background: The goal of ontology matching is to identify correspondences between entities from different yet overlapping ontologies so as to facilitate semantic integration, reuse and interoperability. As a well developed mathematical model for analyzing individuals and structuring concepts, Formal Concept Analysis (FCA) has been applied to ontology matching (OM) tasks since the beginning of OM research, whereas ontological knowledge exploited in FCA-based methods is limited. This motivates the study in this paper, i.e., to empower FCA with as much as ontological knowledge as possible for identifying mappings across ontologies. Methods: We propose a method based on Formal Concept Analysis to identify and validate mappings across ontologies, including one-to-one mappings, complex mappings and correspondences between object properties. Our method, called FCA-Map, incrementally generates a total of five types of formal contexts and extracts mappings from the lattices derived. First, the token-based formal context describes how class names, labels and synonyms share lexical tokens, leading to lexical mappings (anchors) across ontologies. Second, the relation-based formal context describes how classes are in taxonomic, partonomic and disjoint relationships with the anchors, leading to positive and negative structural evidence for validating the lexical matching. Third, the positive relation-based context can be used to discover structural mappings. Afterwards, the property-based formal context describes how object properties are used in axioms to connect anchor classes across ontologies, leading to property mappings. Last, the restriction-based formal context describes co-occurrence of classes across ontologies in anonymous ancestors of anchors, from which extended structural mappings and complex mappings can be identified. Results: Evaluation on the Anatomy, the Large Biomedical Ontologies, and the Disease and Phenotype track of the 2016 Ontology Alignment Evaluation Initiative campaign demonstrates the effectiveness of FCA-Map and its competitiveness with the top-ranked systems. FCA-Map can achieve a better balance between precision and recall for large-scale domain ontologies through constructing multiple FCA structures, whereas it performs unsatisfactorily for smaller-sized ontologies with less lexical and semantic expressions. Conclusions: Compared with other FCA-based OM systems, the study in this paper is more comprehensive as an attempt to push the envelope of the Formal Concept Analysis formalism in ontology matching tasks. Five types of formal contexts are constructed incrementally, and their derived concept lattices are used to cluster the commonalities among classes at lexical and structural level, respectively. Experiments on large, real-world domain ontologies show promising results and reveal the power of FCA.