Doctoral program presentations on Sunday 20, September, 17h00

 

Session A       Room: 117        Chair: David Stynes

17:00

A simple efficient exact algorithm based on independent set for Maxclique problem

Z. Quan

17:20

Continuous Search in Constraint Programming: An Initial Investigation

A. Arbelaez

17:40

Capturing fair computations on Concurrent Constraint Languages

P. Campli

 

Session B       Room: 118        Chair: Elaine Sonderegger

17:00

Preliminary studies of BnB-ADOPT related with Soft Arc Consistency

P. Gutierrez

17:20

Optimal Solutions for Conversational Recommender Systems Based on Comparative Preferences and Linear Inequalities

W. Trabelsi

17:40

Energetic Edge-Finder For Cumulative Resource

R. Kameugne

 

Session C       Room: 119        Chair: Serdar Kadioglu

17:00

Constraint Based Languages for Biological Reactions

M. Bottalico

17:20

An automaton Constraint for Local Search

J. He

17:40

Filtering Technique for Non-normalized CSPs

M. Arangu

 

Session D       Room: 102        Chair: Karen Petrie

17:00

Tractable Benchmarks

J. Petke

17:20

On learning CSP specifications

M. Lopez

17:40

Finding Robust Solutions in Constraint Satisfaction Problems

L. Climent

 

Session E       Room: 143        Chair: Chris Jefferson

17:00

Foundations of Symmetry Breaking Revisited

T. Januschowski

17:20

Propagating equalities and disequalities

N. Moore

17:40

Dominion -- A constraint solver generator

L. Kotthoff

 

 

Session F       Room: 144        Chair: Olivia Madill

17:00

A multithreaded resolution algorithm for QCSP+

J. Vautard

17:20

Research Overview: Improved Boolean Satisfiability Techniques for Haplotype Inference

E. Hsu