Structural Similarity of Boundary Conditions and an Efficient Local Search Algorithm for Goal Conflict Identification

by   Hongzhen Zhong, et al.

In goal-oriented requirements engineering, goal conflict identification is of fundamental importance for requirements analysis. The task aims to find the feasible situations which make the goals diverge within the domain, called boundary conditions (BCs). However, the existing approaches for goal conflict identification fail to find sufficient BCs and general BCs which cover more combinations of circumstances. From the BCs found by these existing approaches, we have observed an interesting phenomenon that there are some pairs of BCs are similar in formula structure, which occurs frequently in the experimental cases. In other words, once a BC is found, a new BC may be discovered quickly by slightly changing the former. It inspires us to develop a local search algorithm named LOGION to find BCs, in which the structural similarity is captured by the neighborhood relation of formulae. Based on structural similarity, LOGION can find a lot of BCs in a short time. Moreover, due to the large number of BCs identified, it potentially selects more general BCs from them. By taking experiments on a set of cases, we show that LOGION effectively exploits the structural similarity of BCs. We also compare our algorithm against the two state-of-the-art approaches. The experimental results show that LOGION produces one order of magnitude more BCs than the state-of-the-art approaches and confirm that LOGION finds out more general BCs thanks to a large number of BCs.



There are no comments yet.


page 1

page 2

page 3

page 4


Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm

We consider a multi-neighborhood local search algorithm with a large num...

How to Identify Boundary Conditions with Contrasty Metric?

The boundary conditions (BCs) have shown great potential in requirements...

NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinator...

Linear regression with partially mismatched data: local search with theoretical guarantees

Linear regression is a fundamental modeling tool in statistics and relat...

A Probabilistic Approach to Satisfiability of Propositional Logic Formulae

We propose a version of WalkSAT algorithm, named as BetaWalkSAT. This me...

CoAPI: An Efficient Two-Phase Algorithm Using Core-Guided Over-Approximate Cover for Prime Compilation of Non-Clausal Formulae

Prime compilation, i.e., the generation of all prime implicates or impli...

Truss-based Structural Diversity Search in Large Graphs

Social decisions made by individuals are easily influenced by informatio...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.