%0 Conference Paper %1 sebastiani04caise %A Sebastiani, Roberto %A Giorgini, Paolo %A Mylopoulos, John %B 16th International Conference on Advanced Information Systems Engineering %C Riga, Latvia %D 2004 %E Persson, Anne %E Stirna, Janis %K evaluation goal i* openome satisfiability %P 20-35 %T Simple and Minimum-Cost Satisfiability for Goal Models %U http://dx.doi.org/10.1007/b98058 %V 3084 %X Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a formal framework for reasoning with goal models, in a qualitative or quantitative way, and we have introduced an algorithm for forward propagating values through goal models. In this paper we focus on the qualitative framework and we propose a technique and an implemented tool for addressing two much more challenging problems: (1) find an initial assignment of labels to leaf goals which satisfies a desired final status of root goals by upward value propagation, while respecting some given constraints; and (2) find an minimum cost assignment of labels to leaf goals which satisfies root goals. The paper also presents preliminary experimental results on the performance of the tool using the goal graph generated by a case study involving the Public Transportation Service of Trentino (Italy).

@inproceedings{sebastiani04caise, abstract = {Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a formal framework for reasoning with goal models, in a qualitative or quantitative way, and we have introduced an algorithm for forward propagating values through goal models. In this paper we focus on the qualitative framework and we propose a technique and an implemented tool for addressing two much more challenging problems: (1) find an initial assignment of labels to leaf goals which satisfies a desired final status of root goals by upward value propagation, while respecting some given constraints; and (2) find an minimum cost assignment of labels to leaf goals which satisfies root goals. The paper also presents preliminary experimental results on the performance of the tool using the goal graph generated by a case study involving the Public Transportation Service of Trentino (Italy). }, added-at = {2008-05-20T17:20:39.000+0200}, address = {Riga, Latvia}, author = {Sebastiani, Roberto and Giorgini, Paolo and Mylopoulos, John}, biburl = {https://www.bibsonomy.org/bibtex/23564712850ec7f59e84124e625b92645/neilernst}, booktitle = { 16th International Conference on Advanced Information Systems Engineering}, editor = {Persson, Anne and Stirna, Janis}, interhash = {b6a8bf7c2ce007f3f9f2433ea3c2330e}, intrahash = {3564712850ec7f59e84124e625b92645}, keywords = {evaluation goal i* openome satisfiability}, month = {June}, pages = {20-35}, series = {Lecture Notes in Computer Science}, timestamp = {2008-08-27T21:46:27.000+0200}, title = {Simple and Minimum-Cost Satisfiability for Goal Models}, url = {http://dx.doi.org/10.1007/b98058}, volume = 3084, year = 2004 }