15th International Workshop on Constraint
Programming
and Decision Making CoProD 2022
Halifax, Nova
Scotia, Canada, May 30, 2022
The workshop will be held right before the Annual Conference of the North
American Fuzzy Information Processing Society NAFIPS'2022,
Halifax, Nova Scotia, Canada, May 31 - June 3, 2022.
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 Atlantic Daylight Time -- which is 1 hour ahead of Eastern Daylight Time. Each talk time includes 5
minutes for questions
14:00-15:00 Marina T. Mizukoshi and Weldon Lodwick
Constraint Interval
15:00-15:30 Martine Ceberio, Olga Kosheleva, and Vladik Kreinovich
How to Describe Relative Approximation Error? A New Justification for
Gustafson's Logarithmic Expression
15:30-16:00 Olga Kosheleva and Vladik Kreinovich
How to Deal with Conflict of Interest Situations When Selecting the
Best Submission
16:00-16:30 Vladik Kreinovich and Saeid Tizpaz-Niari
What Is a Natural Probability Distribution on the Class of All
Continuous Functions: Maximum Entropy Approach Leads to Wiener Measure
16:30-17:00 Salvador Robles, Martine Ceberio, and Vladik Kreinovich
Computing the Range of a Function-of-Few-Linear-Combinations Under
Linear Constraints: A Feasible Algorithm
17:00-17:30 Leobardo Valera, Martine Ceberio, and Vladik Kreinovich
How to Select a Representative Sample for a Family of Functions?
17:30-18:00 Francisco Zapata, Eric Smith, and Vladik Kreinovich
Unexpected Economic Consequence of Cloud Computing: A Boost to
Algorithmic Creativity
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