作　　者： ; ; ; ; ;

机构地区： 北京航空航天大学计算机学院软件工程研究所

出　　处： 《软件学报》 2011年第4期593-608,共16页

摘　　要： 可满足性表示和推理方法是面向目标需求工程领域的重要研究内容.根据从连续定量论域抽取定性概念过程中的主观认知的不确定性特点,提出了一种基于云模型的目标可满足性表示模型.作为定性概念与其定量论域间的不确定性转换模型,云模型能够把主观认知的模糊性和随机性集成在一起,兼顾可满足性定性表示的语义明确性和定量表示的精确性,较好地实现可满足性定性、定量统一表示.在此基础上,设计了一种基于OWA(ordered weighted aggregation)算子核心思想的目标可满足性推理方法,该方法避免了纯逻辑推理过于"偏执"的推理结果.同时,父目标满足程度介于子目标可满足性的最小和最大值之间,较好地反映出了人类一般思维的特点.采用定理证明和对比实验的方式,对推理方法的特点进行分析.最后进行总结,并指出进一步的研究方向. Satisfiability representation and reasoning are important issues in goal-oriented requirements engineering.According to the uncertainty of subjective cognition during abstract qualitative concepts from quantitative universal set,this paper proposes a representation model based on the cloud model for goals satisfiability.The proposed model integrates randomness and fuzziness of subjective perception of goals satisfiability.It has qualitative semantic clarity as well as quantitative accuracy of goals satisfiability.On the basis of the model,the paper presents a reasoning approach based on the core idea of ordered weighted aggregation operators.This approach deduces satisfiability of parent goals between the minimal and maximal satisfiability of sub-goals which reflects the pecularity of human thinking and avoids absolute reasoning results based on pure logic ＂and＂ and ＂or＂.The main characteristics are analyzed through theorem proving and comparison experiments.Finally,conclusions are drawn and research directions are pointed out.

关 键 词： 面向目标需求工程 可满足性表示 目标可满足性推理 云模型 有序加权聚合算子

领　　域： [自动化与计算机技术] [自动化与计算机技术]