Constraint Relationships for Soft Constraints

Alexander Schiendorfer, Jan-Philipp Steghöfer, Alexander Knapp, Florian Nafz, Wolfgang Reif

Constraint Relationships for Soft Constraints

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 clear semantics regarding preferred tuples without assigning priorities to concrete domain values. We show how a CSP including a set of constraint relationships can linearly be transformed into a k-weighted CSP as a representative of c-semirings that is solved by widely available constraint solvers and compare it with existing techniques. We demonstrate the approach by using a typical example of a dynamic and interactive scheduling problem in AI.
published 2013 Proceedings of AI-2013, The Thirty-third SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, in Research and Development in Intelligent Systems XXX

Publisher: Springer International Publishing, Switzerland

ISBN: 978-3-319-02620-6
Reference: DOI:


For questions regarding the publication, please contact!