Preferences in Constraint Satisfaction and Optimization

نویسندگان
چکیده

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

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

منابع مشابه

Preferences in Constraint Satisfaction and Optimization

ion Soft constraints are much more expressive than classical CSPs, but they are also more difficult to process and to solve. Therefore, sometimes it may be too costly to find all, or even only one, optimal solution. Also, although classical propagation techniques like arc-consistency can be extended to soft constraints (Meseguer, Rossi, and Schiex 2006), such techniques can be too costly to be ...

متن کامل

Constraint Satisfaction with Preferences

First works on constraint satisfaction problems (CSP) can be traced in the 70’th but their widespread study and application started since the end of 80’th when the extension of unification algorithm of logic programming led to the proposal of constraint logic programming (CLP) scheme. Introductory part of the thesis introduces both proposals as approaches allowing to express properties of the p...

متن کامل

Constraint Satisfaction with Probabilistic Preferences on Variable Values Constraint Satisfaction with Probabilistic Preferences on Variable Values

Crossword puzzle solving is a classic constraint satisfaction problem, but, when solving a real puzzle, the mapping from clues to variable domains is not perfectly crisp. At best, clues induce a probability distribution over viable targets, which must somehow be respected along with the constraints of the puzzle. Motivated by this type of problem, we provide a formal model of constraint satisfa...

متن کامل

Duality in Optimization and Constraint Satisfaction

We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, surrogate, Lagrangean, superadditive, and constraint duals, as well as duals defined by resolution and filtering algorithms. Inference duals give rise to nogood-based search methods and sensitivity analysis, while relax...

متن کامل

Construction of preferences by constraint satisfaction.

Participants were given a choice between two multiattribute alternatives (job offers). Preferences for the attributes were measured before, during, and after the choices were made. We found that over the course of decision making, the preferences shifted to cohere with the choice: The attributes of the option that was eventually chosen came to be rated more favorably than they had been rated in...

متن کامل

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


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

ژورنال

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

سال: 2008

ISSN: 0738-4602,0738-4602

DOI: 10.1609/aimag.v29i4.2202