To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressi...To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressions （FCDLs） is presented. The syntax and semantics of FCDLs are formally defined, and the forms of axioms and assertions in FCDLs knowledge bases are specified. FCDLs combine both fuzzy concepts from the fuzzy description logics （FDLs） and cut concepts from the extended fuzzy description logics （EFDLs） in the same theory. Furthermore, cut concepts are extended into comparison cut concepts in FCDLs to represent comparison expressions between fuzzy membership degrees, which are often used in practice but not supported by the other fuzzy extensions of description logics. FCDLs have more expressive power than FDLs and EFDLs, and are able to represent expressive fuzzy knowledge and to perform reasoning tasks based on them. Therefore, FCDLs can enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.展开更多
To enable the representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called vague ALC which is based on vague sets is present...To enable the representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called vague ALC which is based on vague sets is presented. The definition of vague set is introduced and then the syntax and semantics of vague ALC are formally defined. The forms of axioms and assertions in the vague ALC knowledge bases are specified. Finally, the tableau algorithm is developed for the reasoning in the vague ALC. The vague ALC based on vague set uses two degrees of membership instead of a single membership degree in the fuzzy sets and is more accurate in representing the imprecision in the degrees of membership. The vague ALC has more expressive power than ALC and can represent fuzzy knowledge and perform reasoning tasks based on them. Therefore, the vague ALC can enable the representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.展开更多
To solve the extended fuzzy description logic with qualifying number restriction （EFALCQ） reasoning problems, EFALCQ is discretely simulated by description logic with qualifying number restriction （ALCQ）, and ALCQ...To solve the extended fuzzy description logic with qualifying number restriction （EFALCQ） reasoning problems, EFALCQ is discretely simulated by description logic with qualifying number restriction （ALCQ）, and ALCQ reasoning results are reused to prove the complexity of EFALCQ reasoning problems. The ALCQ simulation method for the consistency of EFALCQ is proposed. This method reduces EFALCQ satisfiability into EFALCQ consistency, and uses EFALCQ satisfiability to discretely simulate EFALCQ satdomain. It is proved that the reasoning complexity for EFALCQ satisfiability, consistency and sat-domain is PSPACE-complete.展开更多
Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term...Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term definition set, instantiation assertion set and term restriction set. Based on the extended model, the issue on ontology checking was studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.展开更多
This paper proposes an algorithm applied in se mantic P2P network based on the description logics with the purpose for realizing the concepts distribution of resources, which makes the resources semantic locating easy...This paper proposes an algorithm applied in se mantic P2P network based on the description logics with the purpose for realizing the concepts distribution of resources, which makes the resources semantic locating easy. With the idea of the consistent hashing in the Chord, our algorithm stores the addresses and resources with the values of the same type to select instance. In addition, each peer has its own ontology, which will be completed by the knowledge distributed over the network during the exchange of CHGs （classification hierarchy graphs）. The hierarchy classification of concepts allows to find matching resource by querying to the upper level concept because the all concepts described in the CHG have the same root.展开更多
Fuzzy description logics are considered as the logical infrastructure of fuzzy knowledge representation on the semantic Web. To deal with fuzzy and dynamic knowledge on the semantic Web and its applications, a new fuz...Fuzzy description logics are considered as the logical infrastructure of fuzzy knowledge representation on the semantic Web. To deal with fuzzy and dynamic knowledge on the semantic Web and its applications, a new fuzzy extension of Attribute Language with Complement based on dynamic fuzzy logic called the dynamic fuzzy description logic （DFALC） is presented. The syntax and semantics of DFALC are formally defined, and the forms of axioms and assertions are specified. The DFALC provides more reasonable logic foundation for the semantic Web, and overcomes the insufficiency of using fuzzy description logic FALC to act as logical foundation for the semantic Web. The extended DFALC is more expressive than the existing fuzzy description logics and present more fuzzy information on the semantic Web.展开更多
Description logics （DLs） play an important role in representing and reasoning domain knowledge. Conjunctive queries stemmed from the domain of relational databases, and have attracted more attentions in semantic Web...Description logics （DLs） play an important role in representing and reasoning domain knowledge. Conjunctive queries stemmed from the domain of relational databases, and have attracted more attentions in semantic Web recently. To acquire a tractable DL for query answering, DL-Lite is proposed. Due to the large amount of imprecision and uncertainty in the real world, it is essential to extend DLs to deal with these vague and imprecise information. We thus propose a new fuzzy DL f-DLR-Lite.n, which allows for the presence of n-ary relations and the occurrence of concept conjunction on the left land of inclusion axioms. We also suggest an improved fuzzy query language, which supports the presence of thresholds and user defined weights. We also show that the query answering algorithm over the extended DL is still FOL reducible and shows polynomial data complexity. DL f-DLR-Lite,n can make up for the disadvantages of knowledge representation and reasoning of classic DLs, and the enhanced query language expresses user intentions more precisely and reasonably.展开更多
Web Services Choreography Description Language lacks a formal system to accurately express the semantics of service behaviors and verify the correctness of a service choreography model.This paper presents a new approa...Web Services Choreography Description Language lacks a formal system to accurately express the semantics of service behaviors and verify the correctness of a service choreography model.This paper presents a new approach of choreography model verification based on Description Logic.A meta model of service choreography is built to provide a conceptual framework to capture the formal syntax and semantics of service choreography.Based on the framework,a set of rules and constraints are defined in Description Logic for choreography model verification.To automate model verification,the UML-based service choreography model will be transformed,by the given algorithms,into the DL-based ontology,and thus the model properties can be verified by reasoning through the ontology with the help of a popular DL reasoned.A case study is given to demonstrate applicability of the method.Furthermore,the work will be compared with other related research.展开更多
Description logics (DLs) are a family of logic-based knowledge representation formalisms with a number of computer science applications. DLs are especially well-known to be valuable for obtaining logical foundations o...Description logics (DLs) are a family of logic-based knowledge representation formalisms with a number of computer science applications. DLs are especially well-known to be valuable for obtaining logical foundations of web ontology languages (e.g., W3C’s ontology language OWL). Paraconsistent (or inconsistency-tolerant) description logics (PDLs) have been studied to cope with inconsistencies which may frequently occur in an open world. In this paper, a comparison and survey of PDLs is presented. It is shown that four existing paraconsistent semantics (i.e., four-valued semantics, quasi-classical semantics, single-interpretation semantics and dual-interpretation semantics) for PDLs are essentially the same semantics. To show this, two generalized and extended new semantics are introduced, and an equivalence between them is proved.展开更多
Differences in the structure and semantics of knowledge that is created and maintained by the various actors on the World Wide Web make its exchange and utilization a problematic task. This is an important issue facin...Differences in the structure and semantics of knowledge that is created and maintained by the various actors on the World Wide Web make its exchange and utilization a problematic task. This is an important issue facing organizations undertaking knowledge management initiatives. An XML-based and ontology-supported knowledge description language (KDL) is presented, which has three-tier structure (core KDL, extended KDL and complex KDL), and takes advantages of strong point of ontology, XML, description logics, frame-based systems. And then, the framework and XML based syntax of KDL are introduced, and the methods of translating KDL into first order logic (FOL) are presented. At last, the implementation of KDL on the Web is described, and the reasoning ability of KDL proved by experiment is illustrated in detail.展开更多
基金The National Natural Science Foundation of China(No.60373066,60425206,90412003),the National Basic Research Pro-gram of China (973Program)(No.2002CB312000),the Innovation Plan for Jiangsu High School Graduate Student, the High TechnologyResearch Project of Jiangsu Province (No.BG2005032), and the Weap-onry Equipment Foundation of PLA Equipment Ministry ( No.51406020105JB8103).
文摘To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressions （FCDLs） is presented. The syntax and semantics of FCDLs are formally defined, and the forms of axioms and assertions in FCDLs knowledge bases are specified. FCDLs combine both fuzzy concepts from the fuzzy description logics （FDLs） and cut concepts from the extended fuzzy description logics （EFDLs） in the same theory. Furthermore, cut concepts are extended into comparison cut concepts in FCDLs to represent comparison expressions between fuzzy membership degrees, which are often used in practice but not supported by the other fuzzy extensions of description logics. FCDLs have more expressive power than FDLs and EFDLs, and are able to represent expressive fuzzy knowledge and to perform reasoning tasks based on them. Therefore, FCDLs can enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.
基金Program for New Century Excellent Talents in Uni-versity (NoNCET-05-0288)
文摘To enable the representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called vague ALC which is based on vague sets is presented. The definition of vague set is introduced and then the syntax and semantics of vague ALC are formally defined. The forms of axioms and assertions in the vague ALC knowledge bases are specified. Finally, the tableau algorithm is developed for the reasoning in the vague ALC. The vague ALC based on vague set uses two degrees of membership instead of a single membership degree in the fuzzy sets and is more accurate in representing the imprecision in the degrees of membership. The vague ALC has more expressive power than ALC and can represent fuzzy knowledge and perform reasoning tasks based on them. Therefore, the vague ALC can enable the representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.
基金The National Natural Science Foundation of China(No60403016)the Weaponry Equipment Foundation of PLA Equip-ment Ministry (No51406020105JB8103)
文摘To solve the extended fuzzy description logic with qualifying number restriction （EFALCQ） reasoning problems, EFALCQ is discretely simulated by description logic with qualifying number restriction （ALCQ）, and ALCQ reasoning results are reused to prove the complexity of EFALCQ reasoning problems. The ALCQ simulation method for the consistency of EFALCQ is proposed. This method reduces EFALCQ satisfiability into EFALCQ consistency, and uses EFALCQ satisfiability to discretely simulate EFALCQ satdomain. It is proved that the reasoning complexity for EFALCQ satisfiability, consistency and sat-domain is PSPACE-complete.
基金National Natural Science Foundation ofChina(No.70 2 710 3 8)
文摘Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term definition set, instantiation assertion set and term restriction set. Based on the extended model, the issue on ontology checking was studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.
基金Supported by the National Natural Science Foun-dation of China (60403027)
文摘This paper proposes an algorithm applied in se mantic P2P network based on the description logics with the purpose for realizing the concepts distribution of resources, which makes the resources semantic locating easy. With the idea of the consistent hashing in the Chord, our algorithm stores the addresses and resources with the values of the same type to select instance. In addition, each peer has its own ontology, which will be completed by the knowledge distributed over the network during the exchange of CHGs （classification hierarchy graphs）. The hierarchy classification of concepts allows to find matching resource by querying to the upper level concept because the all concepts described in the CHG have the same root.
基金the National Natural Science Foundation of China (60673092)Key Project of Ministry of Education of China (205059)+2 种基金the 2006 Jiangsu Sixth Talented-Personnel Research Program (06-E-037)The Project of Jiangsu Key Laboratory of Computer Information Processing Technologythe Higher Education Graduate Research Innovation Program of Jiangsu Province
文摘Fuzzy description logics are considered as the logical infrastructure of fuzzy knowledge representation on the semantic Web. To deal with fuzzy and dynamic knowledge on the semantic Web and its applications, a new fuzzy extension of Attribute Language with Complement based on dynamic fuzzy logic called the dynamic fuzzy description logic （DFALC） is presented. The syntax and semantics of DFALC are formally defined, and the forms of axioms and assertions are specified. The DFALC provides more reasonable logic foundation for the semantic Web, and overcomes the insufficiency of using fuzzy description logic FALC to act as logical foundation for the semantic Web. The extended DFALC is more expressive than the existing fuzzy description logics and present more fuzzy information on the semantic Web.
基金the Program for New Century Excellent Talents in University (NCET-05-0288)the Specialized Research Fund for the Doctoral Program of Higher Education of China (20050145024)
文摘Description logics （DLs） play an important role in representing and reasoning domain knowledge. Conjunctive queries stemmed from the domain of relational databases, and have attracted more attentions in semantic Web recently. To acquire a tractable DL for query answering, DL-Lite is proposed. Due to the large amount of imprecision and uncertainty in the real world, it is essential to extend DLs to deal with these vague and imprecise information. We thus propose a new fuzzy DL f-DLR-Lite.n, which allows for the presence of n-ary relations and the occurrence of concept conjunction on the left land of inclusion axioms. We also suggest an improved fuzzy query language, which supports the presence of thresholds and user defined weights. We also show that the query answering algorithm over the extended DL is still FOL reducible and shows polynomial data complexity. DL f-DLR-Lite,n can make up for the disadvantages of knowledge representation and reasoning of classic DLs, and the enhanced query language expresses user intentions more precisely and reasonably.
基金This work is supported by the National Natural Science Fund number 61802428.
文摘Web Services Choreography Description Language lacks a formal system to accurately express the semantics of service behaviors and verify the correctness of a service choreography model.This paper presents a new approach of choreography model verification based on Description Logic.A meta model of service choreography is built to provide a conceptual framework to capture the formal syntax and semantics of service choreography.Based on the framework,a set of rules and constraints are defined in Description Logic for choreography model verification.To automate model verification,the UML-based service choreography model will be transformed,by the given algorithms,into the DL-based ontology,and thus the model properties can be verified by reasoning through the ontology with the help of a popular DL reasoned.A case study is given to demonstrate applicability of the method.Furthermore,the work will be compared with other related research.
文摘Description logics (DLs) are a family of logic-based knowledge representation formalisms with a number of computer science applications. DLs are especially well-known to be valuable for obtaining logical foundations of web ontology languages (e.g., W3C’s ontology language OWL). Paraconsistent (or inconsistency-tolerant) description logics (PDLs) have been studied to cope with inconsistencies which may frequently occur in an open world. In this paper, a comparison and survey of PDLs is presented. It is shown that four existing paraconsistent semantics (i.e., four-valued semantics, quasi-classical semantics, single-interpretation semantics and dual-interpretation semantics) for PDLs are essentially the same semantics. To show this, two generalized and extended new semantics are introduced, and an equivalence between them is proved.
文摘Differences in the structure and semantics of knowledge that is created and maintained by the various actors on the World Wide Web make its exchange and utilization a problematic task. This is an important issue facing organizations undertaking knowledge management initiatives. An XML-based and ontology-supported knowledge description language (KDL) is presented, which has three-tier structure (core KDL, extended KDL and complex KDL), and takes advantages of strong point of ontology, XML, description logics, frame-based systems. And then, the framework and XML based syntax of KDL are introduced, and the methods of translating KDL into first order logic (FOL) are presented. At last, the implementation of KDL on the Web is described, and the reasoning ability of KDL proved by experiment is illustrated in detail.
