To solve the problem of chaining distributed geographic information Web services （GI Web services）, this paper provides an ontology-based method. With this method, semantic service description can be achieved by sem...To solve the problem of chaining distributed geographic information Web services （GI Web services）, this paper provides an ontology-based method. With this method, semantic service description can be achieved by semantic annotation of the elements in a Web service description language（WSDL） document with concepts of geographic ontology, and then a common under-standing about service semantics between customers and providers of Web services is built. Based on the decomposition and formalization of customer requirements, the discovery, composition and execution of GI Web services are explained in detail, and then a chaining of GI Web services is built and used to achieve the customer＇s requirement. Finally, an example based on Web ontology language for service （OWL-S） is provided for testing the feasibility of this method.展开更多
To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph （AG）, which is directed labeled graph, is defined and a new AG-based retrieval method is put forward...To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph （AG）, which is directed labeled graph, is defined and a new AG-based retrieval method is put forward. This method converts the knowledge base and query clause into knowledge AG and query AG by making use of the given rules and then makes use of graph traversal to carry out knowledge base retrieval. The experiment indicates that the efficiency of this method exceeds, respectively, the popular RACER and KAON2 system by 0.4% and 3.3%. This method can obviously promote the efficiency of knowledge base retrieval.展开更多
Purpose–The purpose of this paper is to show how description logics(DLs)can be applied to formalizing the information bearing capability(IBC)of paths in entity-relationship(ER)schemata.Design/methodology/approach–Th...Purpose–The purpose of this paper is to show how description logics(DLs)can be applied to formalizing the information bearing capability(IBC)of paths in entity-relationship(ER)schemata.Design/methodology/approach–The approach follows and extends the idea presented in Xu and Feng(2004),which applies DLs to classifying paths in an ER schema.To verify whether the information content of a data construct(e.g.a path)covers a semantic relation(which formulates a piece of information requirement),the principle of IBC under the source-bearer-receiver framework is presented.It is observed that the IBC principle can be formalized by constructing DL expressions and examining constructors(e.g.quantifiers).Findings–Description logic can be used as a tool to describe the meanings represented by paths in an ER schema and formalize their IBC.The criteria for identifying data construct distinguishability are also discovered by examining quantifiers in DL expressions of paths of an ER schema.Originality/value–This paper focuses on classifying paths in data schemas and verifying their formalized IBC by using DLs and the IBC principle.It is a new point of view for evaluation of data representation,which looks at the information borne by data but not data dependencies.展开更多
基金the National Natural Science Fundation ofChina (60774041)
文摘To solve the problem of chaining distributed geographic information Web services （GI Web services）, this paper provides an ontology-based method. With this method, semantic service description can be achieved by semantic annotation of the elements in a Web service description language（WSDL） document with concepts of geographic ontology, and then a common under-standing about service semantics between customers and providers of Web services is built. Based on the decomposition and formalization of customer requirements, the discovery, composition and execution of GI Web services are explained in detail, and then a chaining of GI Web services is built and used to achieve the customer＇s requirement. Finally, an example based on Web ontology language for service （OWL-S） is provided for testing the feasibility of this method.
基金The National Natural Science Foundation of China(No.69975010,60374054),the National Research Foundation for the Doctoral Program of Higher Education of China (No.20050007023).
文摘To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph （AG）, which is directed labeled graph, is defined and a new AG-based retrieval method is put forward. This method converts the knowledge base and query clause into knowledge AG and query AG by making use of the given rules and then makes use of graph traversal to carry out knowledge base retrieval. The experiment indicates that the efficiency of this method exceeds, respectively, the popular RACER and KAON2 system by 0.4% and 3.3%. This method can obviously promote the efficiency of knowledge base retrieval.
基金This work has been funded by Scientific Research Common Program of Beijing Municipal Commission of Education(No.KM201311417011)the Importation and Development of High-Caliber Talents Project of Beijing Municipal Institutions(No.CIT&TCD201404089)Funding project of Beijing Philosophy and Social Science Research Program(No.11JGB039).
文摘Purpose–The purpose of this paper is to show how description logics(DLs)can be applied to formalizing the information bearing capability(IBC)of paths in entity-relationship(ER)schemata.Design/methodology/approach–The approach follows and extends the idea presented in Xu and Feng(2004),which applies DLs to classifying paths in an ER schema.To verify whether the information content of a data construct(e.g.a path)covers a semantic relation(which formulates a piece of information requirement),the principle of IBC under the source-bearer-receiver framework is presented.It is observed that the IBC principle can be formalized by constructing DL expressions and examining constructors(e.g.quantifiers).Findings–Description logic can be used as a tool to describe the meanings represented by paths in an ER schema and formalize their IBC.The criteria for identifying data construct distinguishability are also discovered by examining quantifiers in DL expressions of paths of an ER schema.Originality/value–This paper focuses on classifying paths in data schemas and verifying their formalized IBC by using DLs and the IBC principle.It is a new point of view for evaluation of data representation,which looks at the information borne by data but not data dependencies.
