scholarly journals Capability-oriented architectural analysis method based on fuzzy description logic

2016 ◽  
Vol 13 (1) ◽  
pp. 287-308 ◽  
Author(s):  
Zhang Tingting ◽  
Liu Xiaoming ◽  
Wang Zhixue ◽  
Dong Qingchao

A number of problems may arise from architectural requirements modeling, including alignment of it with business strategy, model integration and handling the uncertain and vague information. The paper introduces a method for modeling architectural requirements in a way of ontology-based and capability-oriented requirements elicitation. The requirements can be modeled within a three-layer framework. The Capability Meta-concept Framework is provided at the top level. The domain experts can capture the domain knowledge within the framework, forming the domain ontology at the second level. The domain concepts can be used for extending the UML to produce a domain-specific modeling language. A fuzzy UML is introduced to model the vague and uncertain features of the capability requirements. An algorithm is provided to transform the fuzzy UML models into the fuzzy Description Logics ontology for model verification. A case study is given to demonstrate the applicability of the method.

2011 ◽  
Vol 181-182 ◽  
pp. 236-241
Author(s):  
Xian Yi Cheng ◽  
Chen Cheng ◽  
Qian Zhu

As a sort of formalizing tool of knowledge representation, Description Logics have been successfully applied in Information System, Software Engineering and Natural Language processing and so on. Description Logics also play a key role in text representation, Natural Language semantic interpretation and language ontology description. Description Logics have been logical basis of OWL which is an ontology language that is recommended by W3C. This paper discusses the description logic basic ideas under vocabulary semantic, context meaning, domain knowledge and background knowledge.


Author(s):  
Thomas Lukasiewicz ◽  
Umberto Straccia

This chapter presents a novel approach to fuzzy description logic programs (or simply fuzzy dl-programs) under the answer set semantics, which is a tight integration of fuzzy disjunctive logic programs under the answer set semantics with fuzzy description logics. From a different perspective, it is a generalization of tightly coupled disjunctive dl-programs by fuzzy vagueness in both the description logic and the logic program component. The authors show that the new formalism faithfully extends both fuzzy disjunctive logic programs and fuzzy description logics, and that under suitable assumptions, reasoning in the new formalism is decidable. The authors present a polynomial reduction of certain fuzzy dl-programs to tightly coupled disjunctive dl-programs, and we analyze the complexity of consistency checking and query processing for certain fuzzy dl-programs. Furthermore, the authors provide a special case of fuzzy dl-programs for which deciding consistency and query processing can both be done in polynomial time in the data complexity.


2011 ◽  
Vol 204-210 ◽  
pp. 381-386 ◽  
Author(s):  
Xian Yi Cheng ◽  
Chen Cheng ◽  
Qian Zhu

As a sort of formalizing tool of knowledge representation, Description Logics have been successfully applied in Information System, Software Engineering and Natural Language processing and so on. Description Logics also play a key role in text representation, Natural Language semantic interpretation and language ontology description. Description Logics have been logical basis of OWL which is an ontology language that is recommended by W3C. This paper discusses the description logic basic ideas under vocabulary semantic, context meaning, domain knowledge and background knowledge.


Author(s):  
FERNANDO BOBILLO ◽  
MIGUEL DELGADO ◽  
JUAN GÓMEZ-ROMERO ◽  
UMBERTO STRACCIA

Ontologies have succeeded as a knowledge representation formalism in many domains of application. Nevertheless, they are not suitable to represent vague or imprecise information. To overcome this limitation, several extensions to classical ontologies based on fuzzy logic have been proposed. Even though different fuzzy logics lead to fuzzy ontologies with very different logical properties, the combined use of different fuzzy logics has received little attention to date. This paper proposes a fuzzy extension of the Description Logic [Formula: see text] — the logic behind the ontology language OWL 2 — that joins Gödel and Zadeh fuzzy logics. We analyze the properties of the new fuzzy Description Logic in order to provide guidelines to ontology developers to exploit the best features of each fuzzy logic. The proposal also considers degrees of truth belonging to a finite set of linguistic terms rather than numerical values, thus being closer to real experts' reasonings. We prove the decidability of the combined logic by presenting a reasoning preserving procedure to obtain a crisp representation for it. This result is generalized to offer a similar reduction that can be applied when any other finite t -norms, t -conorms, negations or implications are considered in the logic.


Author(s):  
HONGYUE HE ◽  
ZHIXUE WANG ◽  
QINGCHAO DONG ◽  
WEIZHONG ZHANG ◽  
WEIXING ZHU

UML is now popularly applied as a requirements modeling language for software system analysis and design, and the dynamic behaviors of system are described in UML behavioral model. As the UML model suffers from lack of well-defined formal semantics, it is difficult to formally analyze and verify the behavioral model. The paper presents a method of UML behavioral model verification based on Description Logic system and its formal inference. The semantics of UML behavioral models is divided into static semantics and dynamic semantics, which are formally specified in OWL DL ontology and DL-Safe rules. To check the consistency of the behavioral models, the algorithms are provided for transforming UML behavioral models into OWL DL ontology, and hence model consistency can be verified through formal reasoning with a DL supporting reasoner Pellet. A case study is provided to demonstrate applicability of the method.


2012 ◽  
Vol 35 (4) ◽  
pp. 767-785
Author(s):  
Jing-Wei CHENG ◽  
Zong-Min MA ◽  
Li YAN ◽  
Fu ZHANG

2020 ◽  
Vol 176 (3-4) ◽  
pp. 349-384
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria

In this paper we consider the most common TBox and ABox reasoning services for the description logic 𝒟ℒ〈4LQSR,x〉(D) ( 𝒟 ℒ D 4,× , for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment 4LQSR. 𝒟 ℒ D 4,× is a very expressive description logic. It combines the high scalability and efficiency of rule languages such as the SemanticWeb Rule Language (SWRL) with the expressivity of description logics. In fact, among other features, it supports Boolean operations on concepts and roles, role constructs such as the product of concepts and role chains on the left-hand side of inclusion axioms, role properties such as transitivity, symmetry, reflexivity, and irreflexivity, and data types. We further provide a KE-tableau-based procedure that allows one to reason on the main TBox and ABox reasoning tasks for the description logic 𝒟 ℒ D 4,× . Our algorithm is based on a variant of the KE-tableau system for sets of universally quantified clauses, where the KE-elimination rule is generalized in such a way as to incorporate the γ-rule. The novel system, called KEγ-tableau, turns out to be an improvement of the system introduced in [1] and of standard first-order KE-tableaux [2]. Suitable benchmark test sets executed on C++ implementations of the three mentioned systems show that in several cases the performances of the KEγ-tableau-based reasoner are up to about 400% better than the ones of the other two systems.


Sign in / Sign up

Export Citation Format

Share Document