Partial Valuation Structures for Qualitative Soft Constraints

نویسندگان

  • Alexander Schiendorfer
  • Alexander Knapp
  • Jan-Philipp Steghöfer
  • Gerrit Anders
  • Florian Siefert
  • Wolfgang Reif
چکیده

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 versatility 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.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Valuation Fuzzy Soft Sets: A Flexible Fuzzy Soft Set Based Decision Making Procedure for the Valuation of Assets

Zadeh’s fuzzy set theory for imprecise or vague data has been followed by other successful models, inclusive of Molodtsov’s soft set theory and hybrid models like fuzzy soft sets. Their success has been backed up by applications to many branches like engineering, medicine, or finance. In continuation of this effort, the purpose of this paper is to put forward a versatile methodology for the val...

متن کامل

k-Hyperarc Consistency for Soft Constraints over Divisible Residuated Lattices

We investigate the applicability of divisible residuated lattices (DRLs) as a general evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs are in fact natural candidates for this role, since they form the algebraic semantics of a large family of substructural and fuzzy logics [GJKO07, Háj98]. We present the following results. (i) We show that DRLs subsume important v...

متن کامل

Hard and soft constraints for reasoning about qualitative conditional preferences

Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework for combined reasoning about these three kinds of information. In this paper we study how to exploit classical and soft constraint solvers for handling qualitative preference statements such as those captured by the CP...

متن کامل

Conflict-Directed A* Search for Soft Constraints

As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft constraints. However, as techniques such as local consistency or conflict learning do not easily generalize to optimization, solving soft constraints appears more difficult than solving hard constraints. In this paper, ...

متن کامل

Solving Soft Constraints by Separating Optimization and Satisfiability

As many real-world problems involve user preferences, costs, or probabilities, the constraint framework has been extended from satisfaction to optimization by extending hard constraints to soft constraints. However, techniques for constraint satisfaction, such as local consistency or conflict learning, do not easily generalize to optimization. Thus, solving soft constraints appears more difficu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015