| Type | Conference Paper |
|---|---|
| Author | Yi Ke |
| Author | K. W. Li |
| Author | K. W. Hipel |
| Pages | 3268-3273 |
| Date | October 2008 |
| DOI | 10.1109/ICSMC.2008.4811800 |
| Library Catalog | IEEE Xplore |
| Conference Name | 2008 IEEE International Conference on Systems, Man and Cybernetics |
| Abstract | Two multiple criteria decision making approaches, an adapted analytical hierarchy process approach and a three-layer hierarchical analysis model based on ELECTRE III, are integrated with the graph model for conflict resolution to elicit decision makers' preference information. To compare their characteristics and capabilities for preference elicitation, both methods are applied to a hypothetical transportation negotiation conflict between two key participants, consisting of shippers and carriers. Some concluding remarks are then made on the commonalitie.s and differences between these two techniques. |
| Proceedings Title | 2008 IEEE International Conference on Systems, Man and Cybernetics |
| Date Added | 13/9/2017, 7:26:52 PM |
| Modified | 13/9/2017, 7:26:52 PM |
| Type | Conference Paper |
|---|---|
| Author | A. Daoudi |
| Author | N. Lazaar |
| Author | Y. Mechqrane |
| Author | C. Bessiere |
| Author | E. H. Bouyakhf |
| Pages | 413-420 |
| Date | November 2015 |
| DOI | 10.1109/ICTAI.2015.69 |
| Library Catalog | IEEE Xplore |
| Conference Name | 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI) |
| Abstract | During the last decade several constraint acquisition systems have been proposed for assisting non-expert users in building constraint programming models. GENACQ is an algorithm based on generalization queries that can be plugged into many constraint acquisition systems. However, generalization queries require the aggregation of variables into types which is not always a simple task for non-expert users. In this paper, we propose a new algorithm that is able to learn types during the constraint acquisition process. The idea is to infer potential types by analyzing the structure of the current constraint network and to use the extracted types to ask generalization queries. Our approach gives good results although no knowledge on the types is provided. |
| Proceedings Title | 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI) |
| Date Added | 12/9/2017, 3:37:11 PM |
| Modified | 12/9/2017, 3:37:11 PM |
| Type | Conference Paper |
|---|---|
| Author | H. Nakagawa |
| Author | T. Tsuchiya |
| Pages | 34-36 |
| Date | May 2015 |
| DOI | 10.1109/RET.2015.14 |
| Library Catalog | IEEE Xplore |
| Conference Name | 2015 IEEE/ACM 2nd International Workshop on Requirements Engineering and Testing |
| Abstract | This paper focuses on the constraints elicitation in the combinatorial test design. Pair-wise testing, a common combinatorial testing approach, is an effective test planning technique to find interaction faults from the relatively small set of test cases. The test space is modeled by a set of parameters, their individual values, and constraints on the value combinations. Constraints reduce the test space, however, little consideration has been given to the process of finding them. The goal of our study is to establish an automatic constraints acquisition from the requirements document. We try to establish a constraints elicitation mechanism that helps to extract constraints from the requirements document based on a linguistic approach. In this paper, as the first step, we attempt to extract the coupling strength between parameters from the requirements document. We conducted a preliminary experiment on an ATM system example and evaluated the feasibility of our approach. |
| Proceedings Title | 2015 IEEE/ACM 2nd International Workshop on Requirements Engineering and Testing |
| Short Title | Towards Automatic Constraints Elicitation in Pair-Wise Testing Based on a Linguistic Approach |
| Date Added | 13/9/2017, 7:27:02 PM |
| Modified | 13/9/2017, 7:27:02 PM |