17th International Workshop on Constraint
Programming
and Decision Making CoProD 2025,
September 22,
2025, Oldenburg, Germany
This workshop will be held right before the 20th International Symposium on
Scientific Computing, Computer Arithmetic, and Verified Numerical
Computation SCAN 2025, Oldenburg, Germany, September 22-26,
2025.
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 Central European time. Each talk time includes 5
minutes for questions
8:30-8:35 am Opening
8:35-9:00 am Luc Jaulin
Optimal separator for an hyperbola; Application to localization
9:00-9:25 am Milan Hladik
Robustness Properties of Absolute Value Linear
Programming Problems and Relations to Interval
Analysis
9:25-9:50 am Ana Tapia-Rosero, Olga Kosheleva, and Vladik Kreinovich
What is the most natural way to propagate subjective interval
uncertainty -- and why
9:50-10:15 am Niklas Winnewisser, Michael Beer, Olga Kosheleva, and
Vladik Kreinovich
How to combine subjective intervals:
a natural idea
10:15-10:40 am Niklas Winnewisser, Michael Beer, Victor Timchenko,
Yuriy Kondratenko, Olga Kosheleva, and Vladik Kreinovich
Why
midpoint, why radius (half-width): invariance-based numerical
characteristics of an interval and how they are related to color
vision and color optical computing
10:40-11:05 am Ildar Z. Batyrshin, Luis A. Villa-Vargas, Nailya I. Kubysheva,
Olga Kosheleva, Muhammad Ahmad, and Imre J. Rudas
Complex
Chemical and Biochemical Reactions: Maybe Fuzzy Techniques
Can Help
11:05-11:30 am Martine Ceberio, Olga Kosheleva, and Vladik Kreinovich
Why topology
helps to detect cyber-intrusions
11:30-11:55 am Jean Rendon, Clariandys Rivera, Afshin Gholamy, and Leobardo Valera
Pre-Hashing as a Cryptographic Tool for
Securing Entrepreneurial Ideas
11:55-12:20 pm Andrea Luces, Jean Rendon, Afshin Gholamy, and Leobardo Valera
Predicting Subsurface
Soil Parameters Using Surface and Satellite Data with Machine Learning Techniques
12:20-12:30 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