Schedule
All hours are displayed in your timezone. Your local time is 03:22 (GMT+0)

Each session (S0, ..., S11, Invited talks, Tutorials, Awards) is repeated three times a day (Blocks 1, 2 and 3).
By default, all blocks and the whole week are displayed. Click on a block to hide/show. Click on a day to display it.

Block 1
06:00 (GMT+0)

Block 2
13:00 (GMT+0)

Block 3
21:00 (GMT+0)

Day 1

Day 2

Day 3

Day 4

Day 5

Every room

Room 1

Room 2

Room 3

Room 4

WS 3: ModRef 2021 - Welcome

Mon 25, 06:45 → Mon 25, 07:00 Room 3

Welcome

WS 3: ModRef 2021 - Session 1

Mon 25, 07:00 → Mon 25, 09:00 Room 3

Torsten Schaub
Invited talk: Answer Set Programming in a Nutshell

Felix Ulrich-Oltean, Peter Nightingale, James Alfred Walker
Selecting SAT Encodings for Pseudo-Boolean and Linear Constraints: Preliminary Results

Peter J. Stuckey, Guido Tack
Enumerated Types, Type Extensions, and Defaults for MiniZinc

Sophia Saller, Jana Koehler
Easy, adaptable and high-quality Modelling with domain-specific Constraint Patterns

DP - Review discussion

Mon 25, 08:30 → Mon 25, 09:00 Room 4

Review discussion

DP - Session 1

Mon 25, 09:00 → Mon 25, 10:00 Room 4

Felix Ulrich-Oltean, Peter Nightingale, James Alfred Walker
Learning to Choose SAT Encodings for Pseudo-Boolean and Integer Sum Constraints

Filippos Pantekis, Phillip James
Massively Parallel SAT: Revisiting 3-SAT

Trong-Hieu Tran, Cédric Pralet, Hélène Fargier
Boosting incomplete search with conflict learning

Mathieu Vavrille, Charlotte Truchet, Charles Prud'Homme
Solution sampling with random table constraints

WS 3: ModRef 2021 - Break

Mon 25, 09:00 → Mon 25, 09:15 Room 3

Break

WS 3: ModRef 2021 - Session 2

Mon 25, 09:15 → Mon 25, 11:15 Room 3

Bart Bogaerts
Invited Talk: The IDP System: what and why?

Jordi Coll, Joan Espasa Arxer, Ian Miguel, Mateu Villaret
A Preliminary Case Study of Planning With Complex Transitions: Plotting

Hélène Verhaeghe, Roger Kameugne, Christophe Lecoutre, Pierre Schaus
Improved Filtering of Scheduling Problems using Redundant Table Constraints

Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon
Towards Reformulating Essence Specifications for Robustness

DP - Panel discussion

Mon 25, 11:00 → Mon 25, 12:15 Room 4

"Presenting your Work"

Panelists: Christine Solnon, Tias Guns, Susanna de Rezende & Christopher Jefferson

Panel discussion

WS 3: ModRef 2021 - Lunch break

Mon 25, 11:15 → Mon 25, 11:45 Room 3

Lunch break

WS 3: ModRef 2021 - Lightning talks and community discussion

Mon 25, 11:45 → Mon 25, 13:30 Room 3

Lightning talks

Community Discussion: Integrating modelling as a component

DP - Break

Mon 25, 12:15 → Mon 25, 12:30 Room 4

Break

DP - Session 2

Mon 25, 12:30 → Mon 25, 13:45 Room 4

Valentin Durante, Thomas Schiex, George Katsirelos
Efficient low rank convex bounds for pairwise discrete Graphical Models

Fulya Trösser, Simon de Givry, George Katsirelos
Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming

Rachid Adrdor, Lahcen Koutti
Combining Directional Arc Consistency with Asynchronous Forward Bounding algorithm

Pierre Montalbano, Simon de Givry, George Katsirelos
Multiple-choice knapsack constraint in CFN

Damir Pulatov, Marie Anastacio, Lars Kotthoff, Holger Hoos
Opening the Black Box: Automated Software Analysis for Algorithm Selection

WS 1: PTHG-21 - Invited talks

Mon 25, 13:00 → Mon 25, 15:00 Room 1

Alexander Felfernig
An Overview of Machine Learning Techniques in Constraint Solving

Samuel Kolb
Democratizing Constraint Satisfaction Problems through Machine Learning

Begüm Genç
Explanation in Constraint Satisfaction: A Survey

WS 2: QCP2021 - Welcome to QCP2021

Mon 25, 13:00 → Mon 25, 13:05 Room 2

Join our Slack workspace.

Kyle E. C. Booth
Welcome2forum

WS 2: QCP2021 - A Whirlwind Introduction to Quantum Computing

Mon 25, 13:05 → Mon 25, 14:45 Room 2

Chair: Kyle E. C. Booth

Ryan LaRose
Quantum computing for computer scientists

Mark Hodson
Solving constraint satisfaction problems on quantum hardware

DP - Social session

Mon 25, 13:45 → Mon 25, 14:45 Room 4

Social session

WS 2: QCP2021 - BREAK / Open discussion

Mon 25, 14:45 → Mon 25, 14:55 Room 2

BREAK / Open discussion

WS 2: QCP2021 - Classical Constraint Solving for Quantum Computing

Mon 25, 14:55 → Mon 25, 16:30 Room 2

Chair: Bryan O'Gorman

Introduction

Robert Wille
Using SAT Solvers for Quantum Computing Design: Potential and Challenges

Lis Arufe, Miguel A. González, Riccardo Rasconi, Angelo Oddi, Ramiro Varela
Quantum circuit compilation by a genetic algorithm for QAOA

Marco Baioletti, Riccardo Rasconi, Angelo Oddi
A novel ant colony optimization strategy for the quantum circuit compilation problem

WS 1: PTHG-21 - Submitted papers

Mon 25, 15:00 → Mon 25, 17:00 Room 1

Dimosthenis C. Tsouros, Kostas Stergiou
Efficient Multiple Constraint Acquisition

Mohamed-Bachir Belaid, Arnaud Gotlieb, Nadjib Lazaar
Solve Optimization Problems with Unknown Constraint Networks

Floris Doolaard, Neil Yorke-Smith
Online Learning of Deeper Variable Ordering Heuristics for Constraint Optimisation Problems

Félix Chalumeau, Ilan Coulon, Quentin Cappart, Louis-Martin Rousseau
SeaPearl: A Constraint Programming Solver Guided by Reinforcement Learning

WS 2: QCP2021 - BREAK / Panel discussion

Mon 25, 16:30 → Mon 25, 17:00 Room 2

BREAK / Panel discussion

WS 1: PTHG-21 - Constraint Acquisition Challenge: Overview

Mon 25, 17:00 → Mon 25, 17:30 Room 1

Constraint Acquisition Challenge: Overview1forum

The CAT System for the PTHG21 Challenge

COUNT CP: Learning CP problems from data

WS 2: QCP2021 - Quantum Computing for Constraint Solving

Mon 25, 17:00 → Mon 25, 18:35 Room 2

Chair: Eleanor Rieffel

Introduction

Ashley Montanaro
Quantum algorithms for constraint satisfaction and optimisation problems

Kunal Marwaha, Stuart Hadfield
Bounds on approximating Max kXOR with quantum and classical local algorithms

Giovanni Lo Bianco, Jiachen Zhang, J. Christopher Beck
Solving quadratic optimization problems with Gaussian Boson sampling

WS 1: PTHG-21 - Questions/Results/Discussion

Mon 25, 17:30 → Mon 25, 18:30 Room 1

Questions/Results/Discussion

WS 2: QCP2021 - BREAK / Open discussion

Mon 25, 18:35 → Mon 25, 18:45 Room 2

BREAK / Open discussion

WS 2: QCP2021 - QUBO & Quantum Annealing

Mon 25, 18:45 → Mon 25, 19:50 Room 2

Chair: Kyle E. C. Booth

Introduction

Amit Verma, Mark Lewis
Constraint programming to discover one-flip local optima of quadratic unconstrained binary optimization problems

Ramin Fakhimi, Rodolfo Quintero, David Bernal, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga
Improved and fully characterized QUBO reformulations of constrained combinatorial optimization problems

Elijah Pelofske, Georg Hahn, Hristo Djidjev
Reducing quantum annealing biases for solving the graph partitioning problem

WS 2: QCP2021 - Closing remarks

Mon 25, 19:50 → Mon 25, 19:55 Room 2

Kyle E. C. Booth
Closing remarks

Schedule All hours are displayed in your timezone. Your local time is 03:22 (GMT+0)

Schedule
All hours are displayed in your timezone. Your local time is 03:22 (GMT+0)