coprod.constraintsolving.comCoProD v 2.021 | Constraint Solving

Constraint Programming and Decision Making Workshop -- Home 2008 2009 2010 2011 2012 2015 2016 Welcome to CoProD 2021 September 12, 2021 -- Online CoProD'20 is the fourteenth edition of CoProD. It will be held on September 12, 2021 (online), right before the International Symposium on Scientific Computing, Computer Arithmetic, and Verified Numerical Computation SCAN 2021 (Sept. 13 to 17). 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. Registration: Registration is free. CoProD 2021 Program and Presentations The program of CoProD 2021 is expected to be announced some time in July 2021 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. CoProD aims at encouraging presentation and discussion of on-going work . In particular, please note that there is room for presentation of ideas , as opposed to results only . It also aims at facilitating networking opportunities as well as cross-fertilization between the approaches used in the different attending 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. Invited Speakers and Program: program of CoProD’17 is now available. -- This year, our invited speakers are TBA. Harald Aschemann , Rostok University, Germany Martine Ceberio , The University of Texas at El Paso, USA Vincent Drevelle , INRIA Rennes – Bretagne Atlantique, France Juan Carlos Figueroa , Universidad Distrital Francisco Jose de Caldas, Bogota, Colombia Milan Hladik , Charles University, Prague, Czech Republic Ide-Flore Kenmogne , INRIA Rennes – Bretagne Atlantique, France Julia Kersten , Rostok University, Germany Olga Kosheleva , The University of Texas at El Paso, USA Vladik Kreinovich , The University of Texas at El Paso, USA Eric Marchand , INRIA Rennes – Bretagne Atlantique, France Tiago Oliveira , National Institute of Informatics (NII) in Tokyo, Japan. Andreas Rauh , Rostok University, Germany Siegfried Rump , Head of the Institute for Reliable Computing at Hamburg University of Technology, Germany, and Visiting Professor at Waseda University in Tokyo, Japan Ken Satoh , National Institute of Informatics (NII) in Tokyo, Japan. Leobardo Valera , The University of Texas at El Paso, USA Francisco Zapata , The University of Texas at El Paso, USA Malileh Zargaran , The University of Texas at El Paso, USA -- scheduled to run from 8:30 a.m. with on-site registration until 5 p.m. .-- The detailed schedule will follow. 8:30: Registration opens 9:00 - 10:00: Keynote presentation: A Dynamic Default Revision Mechanism for Speculative Computation, by Ken Satoh and Tiago Oliveira 10:00 - 10:15: Break 10:15 - 10:45: Reverse Mathematics Is Computable for Interval Computations, by Martine Ceberio, Olga Kosheleva, and Vladik Kreinovich 10:45 - 11:15: A comparison of some T-norms and T-conorms over the steady state of a fuzzy Markov chain, by Juan Carlos Figueroa-Garcıa 11:15 - 11:45: Italian Folk Multiplication Algorithm Is Indeed Better: It Is More Parallelizable, by Martine Ceberio, Olga Kosheleva, and Vladik Kreinovich 11:45 - 12:15: P-completeness of testing solutions of parametric interval linear systems, by Milan Haldik 12:15 - 2:00: Lunch break (on your own) 2:00 - 2:30: Global (un)constrained optimization in INTLAB, by Siegfried Rump 2:30 - 3:00: Using constraint propagation for cooperative UAV localization from vision and ranging, by Ide-Flore Kenmogne, Vincent Drevelle, and Eric Marchand 3:00 - 3:30: Why Burgers Equation: Symmetry-Based Approach, by Leobardo Valera, Martine Ceberio, and Vladik Kreinovich 3:30 - 3:45: Break 3:45 - 4:15: Cooperativity-Preserving Observer Synthesis for the Control of Linear Continuous-Time Systems with Interval Uncertainty, by Andreas Rauh, Julia Kersten, and Harald Aschemann 4:15 - 4:45: Working on One Part at a Time is the Best Strategy for Software: A Proof, by Francisco Zapata, Malileh Zargaran, and Vladik Kreinovich 4:45 - 5:00: Closing remarks -- The previous CoProD meetings featured invited talks by highly recognized experts: Purushotham Bangalore , CIS department, University of Alabama at Birmingham Martin Berz , Michigan State University, USA Stefano Bistarelli , University of Perugia, Italy Alessandro Dal Palu , University of Parma, Italy Rina Dechter , Information and Computer Sciences, University of California Irvine Scott Ferson , Applied Bioinformatics, New York, USA Juan Carlos Figueroa , Universidad Distrital de Bogota, Colombia Patty Hough , Sandia National Lab, Livermore CA Luc Jaulin , Ecole Nationale Superieure des Techniques Avancees (ENSTA) Bretagne, France Kyoko Makino , Michigan State University, USA Tiago Oliveira , National Institute of Informatics (NII) in Tokyo, Japan. Enrico Pontelli , New Mexico State University, Las Cruces, NM James Raynolds , College of Nanoscale and Engineering, SUNY Albany Bart Selman , CS department, Cornell University Yaroslav D. Sergeyev , Università della Calabria, Italy Sergey Shary , Novosibirsk State University Young Jun Son , The University of Arizona, Tucson Ken Satoh , National Institute of Informatics (NII) in Tokyo, Japan. Xiaobai Sun , Duke University Alfredo Vaccaro , University of Sannio, Department of Engineering, Benevento, Italy Leticia Velazquez , The University of Texas at El Paso Francois Modave , Texas Tech Health Center, El Paso Participation / Submission: Participation is encouraged from people doing research in the area of decision making as well as from domain scientists. Submissions of ideas are also encouraged. Submissions are expected in the form of extended abstracts of at least 2 pages and no more than 5 pages (in general, closer to 2 pages for ideas, to 5 pages for results), formatted using the standard LNCS/LNAI format . The title page should include the name, address, and email address of each author as well as a list of keywords. Submissions have to be sent in pdf format AND latex format to mceberio [at] utep [dot] edu. A contact author should be specified in the submission email. The deadline for submissions is April 15, 2021. One author of each accepted abstracts are expected to participate and present their work at the workshop. Proceedings / Publication: A book of abstracts will be made available to each registered participant. After the workshop, the program committee will invite the authors to submit a full article version of their work to be published (after a review process) in a Springer book series. -- Important dates: May 15th: abstract submission June 1st: notification of acceptance July 1st: camera-ready copy of abstracts due September 12th: workshop, online Organization: Organizers: Martine Ceberio , the University of Texas at El Paso, mceberio / utep -o- edu Vladik Kreinovich , the University of Texas at El Paso, vladik / utep -o- edu Location Online, more details to come Contact Info Martine Ceberio and Vladik Kreinovich CoProD Department of Computer Science The University...