Partial Valuation Structures for Qualitative Soft Constraints [chapter]

Alexander Schiendorfer, Alexander Knapp, Jan-Philipp Steghöfer, Gerrit Anders, Florian Siefert, Wolfgang Reif
2015 Lecture Notes in Computer Science  
Soft constraints have proved to be a versatile tool for the specification and implementation of decision making in adaptive systems. A plethora of formalisms have been devised to capture different notions of preference. Wirsing et al. have proposed partial valuation structures as a unifying algebraic structure for several soft constraint formalisms, including quantitative and qualitative ones, which, in particular, supports lexicographic products in a broad range of cases. We demonstrate the
more » ... satility of partial valuation structures by integrating the qualitative formalism of constraint relationships as well as the hybrid concept of constraint hierarchies. The latter inherently relies on lexicographic combinations, but it turns out that not all can be covered directly by partial valuation structures. We therefore investigate a notion for simulating partial valuation structures not amenable to lexicographic combinations by better suited ones. The concepts are illustrated by a case study in decentralized energy management. This research is partly sponsored by the German Research Foundation (DFG) in the project "OC-Trust" (FOR 1085). P r e p r i n t O n l y Preprint only. Manuscript accepted for publication in Springer LNCS 8950 error functions for constraints. So-called comparators define the ordering over assignments. By definition, constraint hierarchies tend to ignore all constraints on higher levels which leads to a strongly hierarchical evaluation. One satisfied constraint is possibly worth more than a whole set of other, violated constraints.
doi:10.1007/978-3-319-15545-6_10 fatcat:xd2oiu5gdbejlftxr7g32hdh5u