Algebraic Structures for Bipolar Constraint-Based Reasoning

The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of evaluation of decisions are often bipolar. The aim of this paper is to provide algebraic structures for the representation of bipolar rules, in the spirit of the algebraic approaches of constraint satisfaction. The structures presented here are general enough to encompass a large variety of rules from the bipolar literature, as well as having appropriate algebraic properties to allow the use of CSP algorithms such as forward-checking and algorithms based on variable elimination.

• Type: Conference
• Year: 2007
• Where: ECSQARU
• Authors: Hélène Fargier, Nic Wilson
• Keywords: Algebraic Structures, Appropriate Algebraic Properties, Bipolar Rules, ECSQARU 2007