16th International Workshop on Constraint
Programming
and Decision Making CoProD 2023
Cincinnati,
Ohio, May 30, 2023
The workshop will be held right before the Annual Conference of the North
American Fuzzy Information Processing Society NAFIPS'2023,
Cincinnati, Ohio, May 31 - June 2, 2023, at the same Digital
Futures Building (3080 Exploration Ave, Cincinnati, Ohio) as the
conference itself, room 145.
Description
Constraint programming techniques are important components of
intelligent systems. They constitute a declarative and efficient
methodology to represent and solve many practical problems. They
have been applied successfully to a number of fields, such as
scheduling of air traffic, software engineering, networks security,
chemistry, and biology. Despite the proved usefulness of these
techniques, they are still under-utilized in real-life
applications. One reason is the perceived lack of effective
communication between constraint programming experts and domain
practitioners about constraints, in general, and their use in
decision making, in particular.
Objectives of CoProD:
- To present advances in constraint solving, optimization, and related topics;
- To develop a network of researchers interested in constraint
techniques, in particular researchers and practitioners that use
numeric and symbolic approaches (or a combination of them) to solve
constraint and optimization problems;
- To address the gap between the great capacity of these techniques and their limited use.
Who Should Participate:
- Participation is encouraged from people doing research in the areas of
decision making and constraint programming.
- CoProD also aims at facilitating networking
opportunities as well as cross-fertilization between the approaches used in different
communities. Therefore, besides active researchers in decision making and constraint
programming techniques, we expect to have a wide attendance and
participation of domain scientists - whose input is highly valued in this workshop.<
- Submissions of ideas are also encouraged.
Program
All times in Eastern Daylight Time. Each talk time includes 5
minutes for questions
2:00-2:20 pm Palvi Aggarwal, Martine Ceberio, Olga Kosheleva, and
Vladik Kreinovich
How People
Make Decisions Based on Prior Experience: Formulas of
Instance-Based Learning Theory (ILBT) Follow from Scale
Invariance
2:20-2:40 pm Martine Ceberio, Olga Kosheleva, and Vladik
Kreinovich
Integrity
First, Service Before Self, and Excellence: Core Values of US Air
Force Naturally Follow from Decision Theory
2:40-3:00 pm Sofia Holguin and Vladik Kreinovich
Conflict
Situations Are Inevitable When There Are Many Participants: A Proof
Based on the Analysis of Aumann-Shapley Value
3:00-3:20 pm Vladik Kreinovich
Computing
at Least One of Two Roots of a Polynomial is, in General, not
Algorithmic
3:20-3:40 pm break
3:40-4:00 pm Juan A. Lopez and Vladik Kreinovich
Towards
Decision Making Under Interval Uncertainty
4:00-4:20 pm Miroslav Svitek, Olga Kosheleva, and Vladik Kreinovich
What
Do Goedel's Theorem and Arrow's Theorem Have in Common: A Possible
Answer to Arrow's Question
4:20-4:40 pm Aaron Velasco, Olga Kosheleva, and Vladik Kreinovich
Low-Probability
High-Impact Events Are Even More Important Than It Is Usually
Assumed
4:40-5:00 pm Jieqiong Zhao, Olga Kosheleva, and Vladik Kreinovich
People
Prefer More Information About Uncertainty, But Perform Worse When
Given This Information: An Explanation of the Paradoxical
Phenomenon
5:00-5:20 pm general discussion
Organizers:
Martine Ceberio and Vladik Kreinovich
Department of Computer Science
The University of Texas at El Paso
500 West University
El Paso, Texas 79968-0518, USA
mceberio [at] utep [dot] edu, vladik [at] utep [dot] edu