Conditional lexicographic orders in constraint satisfaction problems

@article{Wallace2006ConditionalLO,
  title={Conditional lexicographic orders in constraint satisfaction problems},
  author={Richard J. Wallace and Nic Wilson},
  journal={Annals of Operations Research},
  year={2006},
  volume={171},
  pages={3-25}
}
The lexicographically-ordered CSP (“lexicographic CSP” or “LO-CSP” for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Preferences are defined by a total ordering across all assignments, such that a change in assignment to a given variable is more important than any change in assignment to any less important variable. In this paper, we show how this representation can be extended to handle conditional preferences in two ways. In the… 
Lexicographically-ordered constraint satisfaction problems
TLDR
The simple structure of lexicographic CSPs can support specialised algorithms: a branch and bound algorithm with an implicit cost function, and an iterative algorithm that obtains optimal values for successive variables in the importance ordering, both of which can be combined with appropriate variable ordering heuristics to improve performance.
Lexicographic Preference Trees with Hard Constraints
TLDR
A recursive backtrack search algorithm that is called Search-LP to find the most preferable feasible outcome for an LP-tree extended to a set of hard constraints, which it is proved is preferable to every other feasible outcome.
Conditional and Composite Constraints with Preferences
TLDR
This paper extends the conditional and composite CSP framework, managing CSPs in a dynamic environment, in order to handle preferences, and favors the MAC principle as the constraint propagation strategy to be used within the branch and bound procedure.
Managing dynamic CSPs with preferences
TLDR
A new framework, managing Constraint Satisfaction Problems (CSPs) with preferences in a dynamic environment, which supports four types, namely: unary and binary constraint preferences, composite preferences and conditional preferences, and which is handled by four variants of the branch and bound algorithm.
Conditional and Composite Temporal Constraints with Preferences
TLDR
This paper extends the temporal reasoning framework, managing numeric and symbolic information, in order to handle preferences, and proposes a variant of the branch and bound algorithm, which offers more expressive power in representing a wide variety of temporal constraint problems.
Constrained Optimization with Qualitative Preferences
TLDR
It is shown that the Constrained CPR-net has one single optimal outcome that the authors can obtain without dominance testing, and it is proved that the first feasible outcome returned by Search-LP is also preferable to any other feasible outcome.
Learning Lexicographic Preference Trees From Positive Examples
TLDR
This paper presents an algorithm to learn several classes of lexicographic preference trees, proves convergence properties of the algorithm, and experiment on both synthetic data and on a real-world bench in the domain of recommendation in interactive configuration.
Managing Temporal Constraints with Preferences
TLDR
This paper proposes a variant of the branch and bound algorithm, which supports four types of preferences, namely: numeric and symbolic temporal preferences, composite preferences and conditional preferences, and offers more expressive power in representing a wide variety of temporal constraint problems.

References

SHOWING 1-10 OF 20 REFERENCES
Interpretation of Preferences Based on Extended Conditional Lexicographic Orders �
The lexicographically-ordered CSP (“lexicographic CSP” for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs, to support powerful methods for
Ordinal Constraint Satisfaction
TLDR
A new CSP formalism is proposed that incorporates hard constraints and preferences so that the two are easily distinguished both conceptually and for purposes of problem solving, and how algorithm selection can be guided by work on phase transitions.
Valued Constraint Satisfaction Problems: Hard and Easy Problems
TLDR
A simple algebraic framework is considered, related to Partial Constraint Satisfaction, which subsumes most of these proposals and is used to characterize existing proposals in terms of rationality and computational complexity.
Preference-Based Search and Multi-Criteria Optimization
TLDR
This work generalizes PBS to compute balanced, extreme, and Pareto-optimal solutions for general CSPs, thus handling preferences on and between multiple criteria.
An Efficient Upper Approximation for Conditional Preference
TLDR
An upper approximation of conditional preference is defined for which dominance checking is efficient, and which can be applied very generally for CP-theories.
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
TLDR
This paper proposes a qualitative graphical representation of preferences that reflects conditional dependence and independence of preference statements under a ceteris paribus (all else being equal) interpretation, and provides a formal semantics for this model.
The computational complexity of dominance and consistency in CP-nets
TLDR
It is shown here that both dominance and consistency for general CP-nets are PSPACE-complete, and several notions of optimality, and the complexity of the corresponding decision problems are identified.
Consistency and Constrained Optimisation for Conditional Preferences
TLDR
It is shown that a simple logic of conditional preferences can be used to express TCP-net orders, as well as being able to represent much stronger statements of importance than TCP-nets allow.
On Graphical Modeling of Preference and Importance
TLDR
The CP-nets formalism is extended to handle another class of very natural qualitative statements one often uses in expressing preferences in daily life - statements of relative importance of attributes, to better model tradeoffs users would like to make.
Preference‐Based Constrained Optimization with CP‐Nets
TLDR
An approach for constrained optimization based on a set of hard constraints and a preference ordering represented using a CP‐network—a graphical model for representing qualitative preference information offers both pragmatic and computational advantages.
...
...