14th International Worskhop on Constraint Programming and
Decision Making CoProD 2021
Szeged, Hungary, September 12, 2021, online
The workshop will be held right before the
International Symposium on Scientific Computing, Computer
Arithmetic, and Verified Numerical Computation SCAN 2021, Szeged,
Hungary, online, September 13-17, 2021.
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.
Registration:
Registration is free. To register, send your name, affiliation, and
email to the organizers.
Program
All times in Szeged, Hungary -- which has the same time as most other places in Central
Europe. Each talk time includes 5
minutes for questions
15:30-15:50 Sean R. Aguilar, Olga Kosheleva, and Vladik Kreinovich
Why Base-20, Base-40, and Base-60 Number Systems?
15:50-16:20 Mohammad Adm, Juergen Garloff, Jihad Titi, and Ali Elgayar
Bounding the range of a sum of multivariate rational functions
16:20-16:40 Martine Ceberio, Christian Servin, Olga Kosheleva, and
Vladik Kreinovich
How to Best Write Research Papers: Basic English? Sophisticated
English?
16:40-17:10 Matyas Lorenc
B-matrices and their generalizations in the interval setting
17:10-17:30 Luc Longpre, Olga Kosheleva, and Vladik Kreinovich
Additional Spatial Dimensions Can Help Speed Up Computations
17:30-18:00 Evgeny Dantsin, Alex Wolpert, and Vladik Kreinovich
An AlphaZero-Inspired Approach to Solving Search Problems
18:00-18:30 break
18:30-18:50 Luc Longpre, Olga Kosheleva, and Vladik Kreinovich
Baudelaire's Ideas of Vagueness and Uniqueness in Art:
Algorithm-Based Explanations
18:50-19:20 David P. Sanders
Interval constraint programming: Symbolics and code generation
towards the GPU
19:20-19:40 Julio Urenda, Martine Ceberio, Olga Kosheleva, and
Vladik Kreinovich
Why Homogeneous Membranes Lead to Optimal Water Desalination: A
Possible Explanation
19:40-20:10 Javier Viana, Stephan Ralescu, Kelly Cohen, Anca Ralescu, and
Vladik Kreinovich
Extension to multi-dimensional problems of a fuzzy-based explainable
and noise-resilient algorithm
20:10-20:30 Julio C. Urenda, Olga Kosheleva, and Vladik Kreinovich
Dimension Compactification Naturally Follows from First Principles
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