In this work we extend the geometric approach to the theory of evidence in order to study the geometric behavior of the two quantities inherently associated with a belief function. i.e. the plausibility and commonality functions. After introducing the analogous of the basic probability assignment for plausibilities and commonalities, we exploit it to understand the simplicial form of both plaus...

Although Case-Based Reasoning (CBR) is a natural formulation for many problems, our previous work on CBR as applied to design made it apparent that here were elements ofthe CBR paradigm that prevented it from being more widely applied. At the same time, we were evaluating Constraint Satisfaction techniques for design, and found a commonality in motivation between repair-based constraint sa isfa...

Component-based software engineering (CBSE) is being accepted as an effective paradigm for building software systems with reusable components. Product line software engineering (PLSE) is an approach that utilizes CBSE principles to support the economic development of several applications in a domain. Hence, the components should conform to relevant domain standards and they must at least provid...

Although feature modelling is a frequently used approach to the task of modelling commonality and variability within product lines, there is currently no standard modelling notation or methodology. On the assumption that the commonality/variability model will be used as a basis for architecture design, our modelling notation allows features to be augmented with behavioural detail, captured usin...

We prove the NP-completeness of the so-called Social Group Commonality (SGC) problem which queries the commonality among the objects ‘touched’ by collections of agents while executing an action. Although it naturally arises in several contexts, e.g., in profiling the behavior of a collection of system users, SGC (to the authors’ knowledge) has been ignored. Our proof of SGC NP-completeness cons...

We prove the NP-completeness of a problem, we call Social Group Commonality (SGC), which queries the commonality amongst the objects ‘touched’ by a collections of agents while executing an action. Although it naturally arises in several contexts, e.g., to profile the behaviour of a collection of system users, SGC has, to the authors’ knowledge, been ignored. Our proof of SGC NP-completeness con...

In this work we extend the geometric approach to the theory of evidence in order to study the geometric behavior of the two quantities inherently associated with a belief function. i.e. the plausibility and commonality functions. After introducing the analogous of the basic probability assignment for plausibilities and commonalities, we exploit it to understand the simplicial form of both plaus...