Distributed Constraint Satisfaction as a Computational Model of Negotiation via Argumentation

Author(s):  
Hyuckchul Jung
2006 ◽  
Vol 176 (5) ◽  
pp. 490-521 ◽  
Author(s):  
Ilias Sakellariou ◽  
Ioannis Vlahavas ◽  
Ivan Futo ◽  
Zoltan Pasztor ◽  
Janos Szeredi

Author(s):  
Djamila Haroud ◽  
Sylvie Boulanger ◽  
Esther Gelle ◽  
Ian Smith

AbstractMuch of preliminary engineering design is a constraint-driven non-monotonic exploration process. Initial decisions are made when information is incomplete and many goals are contradictory. Such conditions are present regardless of whether one or several designers contribute to designs. This paper presents an approach for supporting decisions in situations of incomplete and conflicting knowledge. In particular, we use assumptions and conflict management to achieve efficient search in contexts where little reliable information exists. A knowledge representation, containing a semantic differentiation between two types of assumptions, is used within a computational model based on the dynamic constraint satisfaction paradigm. Conflict management strategies consist of three generic mechanisms adapted to the type of constraints involved. These strategies may be refined through consideration of variable importance, context, and design inertia.


Sign in / Sign up

Export Citation Format

Share Document