09h00-09h30: Alessandro Dal Palù, Agostino Dovier, Andrea Formisano, Alberto Policriti, Enrico Pontelli. Logic Programming Applied to Genome Evolution in Cancer
09h30-10h00: Katinka Becker, Martin Gebser, Torsten Schaub and Alexander Bockmayr. Answer Set Programming for Logical Analysis of Data
10h00-10h30: Louis Fippo Fitime, Olivier Roux, Carito Guziolowski and Loïc Paulevé. Identification of Bifurcations in Biological Regulatory Networks using Answer-Set Programming
10h30-11h00: Jean-Marc Alliot, Martín Diéguez and Luis Farinas del Cerro. Metabolic Pathways as Temporal Logic Programs
11h00-11h30: Martin Morterol, Philippe Dague, Sabine Peres and Laurent Simon. Minimality of Metabolic Flux Modes under Boolean Regulation Constraints
Abstract: Languages and algorithms of Constraint Programming have made a significant impact on Artificial Intelligence, and were driven to a large extent by the Artificial Intelligence agenda. An area where cross-fertilization has been particularly productive is in Graphical Models. Much of this work is at the level of (propositional) solvers and algorithms only. However, the experience gained in the CP community in developing Constraint Programming languages may not have gone far enough in penetrating the rest of AI. An excellent opportunity for changing that exists in the recent area of Probabilistic Programming.
CP may join the language effort by extending its constraint languages to accommodate uncertainty and continuous variables, and develop solvers that can effectively handle first-order deterministic and probabilistic queries. In addition, equipping such languages with anytime approximation solvers that have predictive performance guarantees could lead to new paradigms (e.g., “Approximate Programming”).
I will present some observations and thoughts along those lines.
13h30-14h00: Clément Viricel, David Simoncini, Thomas Schiex and Sophie Barbe. Guaranteed Weighted Counting for Affinity Computation: beyond Determinism and Structure (CP2016 paper)
14h00-14h30: Maryana Wånggren, Martin Billeter, and Graham Kemp. Computational protein modelling based on limited sets of constraints
14h30-15h00: Ludwig Krippahl and Pedro Barahona. Improving protein docking with redundancy constraints (CP2016 paper)
15h30-16h00: Sebastien François, Rumen Andonov, Hristo Djidjev and Dominique Lavenier. Global Optimization Methods for Genome Scaffolding
16h00-16h30: Eric Bourreau, Annie Chateau, Clément Dallard and Rodolphe Giroudeau. A Graph Constraints Formulation for Contigs Scaffolding
Matching problems typically involve assigning agents to commodities, possibly on the basis of ordinal preferences or other metrics. These problems have large-scale applications to centralised matching schemes in many countries and contexts.
In this talk I will describe the matching problems featuring in two such schemes in the UK that have involved collaborations between the National Health Service and the University of Glasgow. One of these dealt with the allocation of junior doctors to Scottish hospitals (1999-2012), and the other is concerned with finding kidney exchanges among incompatible donor-patient pairs across the UK (2007-date). In each case I will describe the applications, present the underlying (NP-hard) algorithmic problems, outline the various solution techniques and give an overview of results arising from real data connected with the matching schemes in recent years.
10:30-10:55 Emmanuel Hebrard, Marie-José Huguet, Daniel Veysseire, Ludivine Boche Sauvan and Bertrand Cabon. Constraint Programming for Planning Test Campaigns of Telecommunication Satellites
10:55-11:20 Xavier Lorca, Charles Prud'Homme, Aurélien Questel and Benoît Rottembourg. Using Constraint Programming for the Urban Transit Crew Rescheduling Problem
11:20-11:45 Stefano Di Alesio. Optimal Performance Tuning in Real-Time Systems using Multi-Objective Constrained Optimization
11:45-12:10 Feifei Ma, Xin Gao, Minghao Yin, Linjie Pan, Jiwei Jin, Hai Liu and Jian Zhang. SymOptimizing Shortwave Radio Broadcast Resource Allocation via Pseudo-Boolean Constraint Solving and Local Search
10:30-10:55 David Cohen and Peter Jeavons. The Power of Propagation: When GAC is Enough
10:55-11:20 Dominik Scheder, Timon Hertli, Isabelle Hurbain, Sebastian Millius, Robin Moser and May Szedlak. The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors
11:20-11:45 Martin Cooper, Achref El Mouelhi and Cyril Terrioux. Broken Triangles, Yet Again
Computational sustainability is a new interdisciplinary research field with the overall goal of developing computational models, methods, and tools to help manage balancing environmental, economic, and societal needs for sustainable development. The notion of sustainable development — development that meets the needs of the present without compromising the ability of future generations to meet their needs — was introduced in "Our Common Future," a seminal report on the future of our planet, published in 1987 by the United Nations World Commission on Environment and Development.
We will provide an overview of the field of computational sustainability. We will highlight a number of examples related to our research on biodiversity and conservation, natural resource management, and energy.
We will also provide an overview of the computational challenges and methods for computational sustainability. Research in this area combines concepts and methods from constraint reasoning and inference, optimisation, decision making under uncertainty, machine learning, citizen science, crowdsourcing, and human computation.
14:40-15:05 Yexiang Xue, Ian Davies, Daniel Fink, Christopher Wood and Carla Gomes. Behavior Identification in Two-stage Games for Incentivizing Citizen Science Exploration
15:05-15:30 Boon Ping Lim, Hassan Hijazi, Sylvie Thiebaux and Menkes Van Den Briel. Online HVAC-Aware Occupancy Scheduling with Adaptive Temperature Control
14:40-15:05 Pierre Roy, Guillaume Perez, Jean-Charles Regin, Alexandre Papadopoulos, Francois Pachet and Marco Marchini. Enforcing Structure on Temporal Sequences: the Allen Constraint
15:05-15:30 Alexandre Papadopoulos, Pierre Roy and Francois Pachet. Assisted Lead Sheet Composition using FlowComposer
16:00-16:25 John Hooker. Finding Alternative Musical Scales
16:00-16:25 Jack Goffinet and Raghuram Ramanujan. Monte-Carlo Tree Search for the Maximum Satisfiability Problem
16:50-17:15 Jimmy Lee and Zichen Zhu. Boosting SBDS for Partial Symmetry Breaking in Constraint Programming
16:50-17:15 Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin and Pierre Schaus. Compact-Table: efficiently filtering table constraints with reversible sparse bit-sets
11:15:11:40 Ferdinando Fioretto, William Yeoh and Enrico Pontelli. A Dynamic Programming-based MCMC Framework for Solving DCOPs with GPUs
11:15-11:40 Xiaojun Sun, Irina Ilioaea, Priyank Kalla and Florian Enescu. Finding Unsatisfiable Cores of a Set of Polynomials using the Groebner Basis Algorithm
13:35-14:00 Vincent Goulet, Wei Li, Hyunmin Cheong, Francesco Iorio and Claude-Guy Quimper. Four-Bar Linkage Synthesis Using Non-Convex Optimization
14:00-14:25 Robinson Duque, Alejandro Arbelaez and Juan Francisco Díaz. SABIO: An Implementation of MIP and CP for Interactive Soccer Queries
13:35-14:00 Martin Cooper and Stanislav Živný. The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
14:00-14:25 Chavalit Likitvivatanavong, Wei Xia and Roland H. C. Yap. Decomposition of the Factor Encoding for CSPs
15:20-15:45 Joshua Blinkhorn and Olaf Beyersdorff. Dependency Schemes in QBF Calculi: Semantics and Soundness
15:45-16:10 Michael Codish, Graeme Gange, Avi Itzhakov and Peter J. Stuckey. Breaking Symmetries in Graphs: The Nauty Way
15:20-15:45 Clément Carbonnel and Emmanuel Hebrard. Constraint Propagation via Kernelization
15:45-16:10 Ekaterina Arafailova, Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Maria Andreina Francisco Rodriguez, Justin Pearson and Helmut Simonis. Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints
16:35-17:00 Jeremias Berg and Matti Järvisalo. Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving
16:35-17:00 Anthony Palmieri, Jean-Charles Régin and Pierre Schaus. Parallel Strategies Selection Strategy, strategy selection, algorithm selection, parallelism
10:15-10:40 Krishnamurthy Dvijotham, Pascal Van Hentenryck, Michael Chertkov, Sidhant Misra and Marc Vuffray. Graphical models for optimal power flow
10:40-11:05 David Manlove, Iain McBride and James Trimble. "Almost-stable" matchings in the Hospitals / Residents problem with Couples
11:05-11:30 Clément Carbonnel. The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable
13:30-13:55 Katherine Giles and Willem-Jan Van Hoeve. Solving a Supply-Delivery Scheduling Problem with Constraint Programming
13:30-13:55 Clément Viricel, David Simoncini, Thomas Schiex and Sophie Barbe. Guaranteed Weighted Counting for Affinity Computation: beyond Determinism and Structure
The ACP Doctoral Research Award is awarded every year to a promising young researcher working in the area of constraint programming and who defended his/her thesis between January and December of the previous two years. The award, in the form of a certificate, will be presented at the CP conference, where the winning researcher will present a talk on the topic of his/her doctoral dissertation.
Previous recipients of this award are:
The purpose of this award is to celebrate those CP community members who have made exceptional contributions to the CP community. Areas of service could include, but are not limited to: association service, service as an editor, conference organisation, representation of CP in other organizations, etc, resulting in positive effects on the field of CP.
Previous recipients of this award are:
10:30-10:55 Giovanni Di Liberto, Serdar Kadioglu, Kevin Leo and Yuri Malitsky. DASH: Dynamic Approach for Switching Heuristics
10:55-11:20 Cristinca Fulga. AHP based portfolio selection with risk preference modeling
11:20-11:45 Kyle E. C. Booth, Tony T. Tran, Goldie Nejat and Chris Beck. Mixed-Integer and Constraint Programming Techniques for Mobile Robot Task Planning
10:30-10:55 Alessio Bonfietti, Michele Lombardi, Alessandro Zanarini and Michela Milano. The Multirate Resource Constraint
10:55-11:20 Andreas Schutt and Peter J. Stuckey. Explaining Producer/Consumer Constraints
13:40-14:05 Thibaut Feydy and Peter J. Stuckey. Interval Constraint with Learning : Application to Air Traffic Control
14:05-14:30 Maxim Shishmarev, Christopher Mears, Maria Garcia De La Banda and Guido Tack. Learning from Learning Solvers
14:30-14:55 Philippe Jégou, Hanan Kanso and Cyril Terrioux, Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size
14:55-15:20 Diego de Uña, Graeme Gange, Peter Schachte and Peter J. Stuckey. A Bounded Path Propagator on Directed Graphs
13:40-14:05 Harsha Nagarajan, Mowen Lu, Emre Yamangil and Russell Bent. Tightening McCormick Relaxations for Nonlinear Programs via Dynamic Multivariate Partitioning
14:05-14:30 Wen-Yang Ku and Chris Beck. Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems
14:30-14:55 Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser and Christine Solnon. Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems
15:30-15:55 Alexey Ignatiev, Alessandro Previti and Joao Marques-Silva. On Finding Minimum Satisfying Assignments
15:30-15:55 Alexander Tesch. A Nearly Exact Propagation Algorithm for Energetic Reasoning in O(n²·log n)