Constraint Relationships for Soft Constraints

@inproceedings{Schiendorfer2013ConstraintRF,
  title={Constraint Relationships for Soft Constraints},
  author={Alexander Schiendorfer and Jan-Philipp Stegh{\"o}fer and Alexander Knapp and Florian Nafz and Wolfgang Reif},
  booktitle={SGAI Conf.},
  year={2013}
}
We introduce constraint relationships as a means to define qualitative preferences on the constraints of soft constraint problems. The approach is aimed at constraint satisfaction problems (CSPs) with a high number of constraints that make exact preference quantizations hard to maintain manually or hard to anticipate—especially if constraints or preferences change at runtime or are extracted from natural language text. Modelers express preferences over the satisfaction of constraints with a… 
Quality over Quantity in Soft Constraints
TLDR
This work illustrates the application of constraint relationships in a case study from energy management along with deficiencies of existing work, and shows how to embed constraint relationships into the soft constraint frameworks of partial valuation structures and further c-semi rings by means of free constructions.
Pr ep rin t O nly Quality over Quantity in Soft Constraints
TLDR
This work illustrates the application of constraint relationships in a case study from energy management along with deficiencies of existing work and shows how to embed constraint relationships into the softconstraint frameworks of partial valuation structures and further c-semirings by means of free constructions.
Partial Valuation Structures for Qualitative Soft Constraints
TLDR
A notion for simulating partial valuation structures not amenable to lexicographic combinations by better suited ones is investigated, which is illustrated by a case study in decentralized energy management.
MiniBrass: Soft constraints for MiniZinc
TLDR
MiniBrass is introduced, a versatile soft constraint modeling language building on the unifying algebraic framework of partially ordered valuation structures (PVS) that is implemented as an extension of MiniZinc and MiniSearch and provides the most general construction of a c-semiring from an arbitrary PVS.
Soft Constraints in MiniBrass: Foundations and Applications
TLDR
This dissertation describes MiniBrass, a versatile soft constraint modeling language building on the unifying algebraic framework of partially-ordered valuation structures (PVS), implemented as an extension of MiniZinc and MiniSearch.
Synthesis and Abstraction of Constraint Models for Hierarchical Resource Allocation Problems
TLDR
Algorithms are presented to create synthesised and abstracted models of agents providing a certain resource into a centrally and efficiently solvable optimisation problem and the creation of an abstracted version of this centralised model that reduces its complexity when passing it on to higher layers.
Abstraction of Heterogeneous Supplier Models in Hierarchical Resource Allocation
TLDR
This work presents a hierarchical “regio-central” decomposition based on abstraction that is designed to change its structure at runtime and suggests a formalization termed supply automata to capture suppliers and presents algorithms for synthesis and abstraction.
Constraint Programming for Hierarchical Resource Allocation
TLDR
This work gives an overview of existing techniques to use constraint programming in collective systems solving resource allocation problems, and considers future extensions.
Synthesised constraint models for distributed energy management
TLDR
This work presents a modelling methodology that allows organisations to specify optimisation goals independently of concrete participants and participants to craft more detailed models and state individual preferences and gives a formulation of warm and cold start-up times for power plants that improves existing power plant models.
Specification and Design of Trust-Based Open Self-Organising Systems
TLDR
Algorithms for self-organisation and self-optimisation that enable the formation of scalable system structures at runtime and allow for efficient and robust resource allocation under adverse conditions are presented.
...
1
2
...

References

SHOWING 1-10 OF 24 REFERENCES
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.
Preferences in Constraint Satisfaction and Optimization
TLDR
It is described how AI techniques such as abstraction, explanation generation, machine learning, and preference elicitation, can be useful in modelling and solving soft constraints.
Dynamic Constraint Satisfaction
TLDR
This paper presents a language for expressing four types of activity constraints in terms of variable values and variables being considered, and describes an implemented algorithm that enables tight interaction between constraints about variable activity and constraints aboutVariable values.
Dynamic Constraint Satisfaction Problems
TLDR
This paper presents a language for expressing four types of activity constraints in terms of variable values and variables being considered, and describes an implemented algorithm that enables tight interaction between constraints about variable activity and constraints aboutVariable values.
Partial Constraint Satisfaction
Constraint Solving over Semirings
TLDR
A constraint solving framework where all such extensions, as well as classical CSPs, can be cast, and this framework can be used to model both old and new constraint solving schemes, allowing one to formally justify many informally taken choices in existing schemes.
Constraint hierarchies
TLDR
In the discussion of a theory of constraint hierarchies, alternate ways of selecting among competing possible solutions are presented, and a number of propositions about the relations among these alternatives are proved.
Soft Constraints
A Constraint-Based Approach to Preference Elicitation and Decision Making
TLDR
The goal of this project is to develop algorithms that generate the most preferred feasible configuration by posing preference queries to the user by taking into account constraints over the set of feasible configurations.
Arc-Consistency in Dynamic Constraint Satisfaction Problems
TLDR
There is an advantage to use this specific algorithm for dynamic CSPs in almost all the cases tested, and the performances of the algorithm proposed here and of the best algorithm achieving arc-consistency in static C SPs are compared on randomly generated dynamic Csps.
...
1
2
3
...