Day 1
Time Track A (Room 1)
7:00-9:00 Breakfast (80 - 100 people)
8:00-9:00 Registration
9:00-10:00 Keynote Speaker (All Participants)
10:00-11:00  Session A-1.A   SAT/CSP Track:   Invited Keynote 1 
10:00-11:00 Stefan Szeider. Capturing Structure in Hard Combinatorial Problems.
11:00-12:00 Session A-1.B   SAT/CSP Track  Constraint Reasoning I
11:00-11:30 Bertrand Neveu and Gilles Trombettoni. Adaptive Constructive Interval Disjunction
11:30-12:00 Paolo Codenotti, Hadi Katebi, Karem A. Sakallah and Igor L. Markov. Conflict Analysis and Branching Heuristics in the Search for Graph Automorphisms.
12:00-13:30 Lunch
13:30-14:30 Keynote speaker All participants
14:30-16:00 Session A-2  SAT/CSP Track: Complexity, Games, Constraint Games
14:30-15:00 Achref El Mouelhi, Philippe Jegou and Cyril Terrioux. Hybrid Tractable Class for Non-Binary CSPs.
15:00-15:30 Eric Gregoire, Atef Hasni, Bertrand Mazure and Cˇdric Piette. Solving E-SquarO through SAT-coding.
15:30-16:00 Thi-Van-Anh Nguyen, Arnaud Lallouet and Lucas Bordeaux. Constraint Games: Framework and Local Search Solver.
16:10-16:40 Coffee Break
16:40-18:00 Session A-3  Main Track: AI Foundations
16:40-17:00 Toru Ogawa, Yangyang Liu, Ryuzo Hasegawa, Miyuki Koshimura and Hiroshi Fujita. Modulo Based CNF Encoding of Cardinality Constraints and Its Application to MaxSAT Solvers.
17:00-17:20 Jason Jingshi Li and Sanjiang Li. On Finding Approximate Solutions of Qualitative Constraint Networks.
17:20-17:40 Viktoriya Degeler and Alexander Lazovik. Dynamic Constraint Reasoning in Smart Environments. 
17:40-18:00 Xiaojuan Liao, Hui Zhang, Miyuki Koshimura, Hiroshi Fujita and Ryuzo Hasegawa. Using MaxSAT to Correct Errors in AES Key Schedule Images.
18:00-20:00  Poster Session
Day 2
Time Track A (Room 1)
7:00-9:00 Breakfast
9:00-10:00 Keynote Speaker (All Participants)
10:00-11:00  Session A-4.A   SAT/CSP Track: Invited Keynote 2
10:00-11:00 Peter Van Beek. Constraint Programming in Compiler Optimization: Lessons Learned.
11:00-12:00 Session A-4.B   SAT/CSP Track: Constraint Reasoning II
11:00-11:30 Pierre Schaus. Variable Objective Large Neighborhood Search: A practical approach to solve over-constrained problems.
11:30-12:00 Jimmy H.M. Lee, Terrence W.K. Mak and Yuxiang Shi. A General Privacy Loss Aggregation Framework for Distributed Constraint Reasoning.
12:00-13:30 Lunch
13:30-15:30 Session A-5  SAT/CSP Track.  MUS, Cores and Max-SAT. 
13:30-14:00 Christophe Lecoutre, Nicolas Paris, Olivier Roussel and Sebastien Tabary. Solving WCSP by Extraction of Minimal Unsatisfiable Cores.
14:00-14:30 Eric Grˇgoire, Jean Marie Lagniez and Bertrand Mazure. Questioning the Importance of WCORE-like Minimization Steps in MUC-finding Algorithms.
14:30-15:00 Antonio Morgado, Federico Heras and Joao Marques-Silva. Model-Guided Approaches for MaxSAT Solving.
15:00-15:30 Chu-Min Li, Zhiwen Fang and Ke Xu. Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem.
15:30-16:00 Coffee Break
16:00-18:00 Session A-6 SAT/CSP Track.  Heuristics. 
16:00-16:30 Hidetomo Nabeshima, Koji Iwanuma and Katsumi Inoue. On-The-Fly Lazy Clause Simplification based on Binary Resolvents.
16:30-17:00 Erich Teppan and Gerhard Friedrich. Declarative Heuristics in Constraint Satisfaction.
17:00-17:30 Ignacio Araya, Victor Reyes and Cristian Orellana. More Smear-based Variable Selection Heuristics for NCSPs.
17:30-18:00 Deepak Mehta, Barry O'Sullivan, Lars Kotthoff and Yuri Malitsky. Lazy Branching for Constraint Satisfaction.
18:00-20:00 ICTAI Committees + Banquet
Day 3
Time Track A (Room 1)
7:00-9:00 Breakfast
9:00-10:00 Keynote Speaker (All Participants)
10:00-12:00 Session A-7  SAT/CSP Track.  Encoding and Translation issues. Meta-Models. 
10:00-10:30 Naoyuki Tamura, Mutsunori Banbara and Takehide Soh. Compiling Pseudo-Boolean Constraints to SAT with Order Encoding.
10:30-11:00 Van-Hau Nguyen, Miroslav N. Velev and Pedro Barahona. Application of Hierarchical Hybrid Encodings to Efficient Translation of CSPs to SAT.
11:00-11:30 Joseph D. Scott, Pierre Flener and Justin Pearson. Bounded Strings for Constraint Programming. 
11:30-12:00 Adel Ferdjoukh, Anne-Elisabeth Baert, Annie Chateau, Remi Coletta and Clementine Nebut. A CSP Approach for Metamodel Instantiation.
12:00-13:30 Lunch
13:30-15:30 Session A-8 SAT/CSP Track. Constraint Reasoning III
13:30-14:00 Luis Quesada, Ken Brown, Barry O'Sullivan, Lanny Sitanayah and Cormac Sreenan. A Constraint Programming Approach to the Additional Relay Placement Problem in Wireless Sensor Networks.
14:00-14:30 Thi-Bich-Hanh Dao, Khanh-Chuong Duong and Christel Vrain. A Filtering Algorithm for Constrained Clustering with Within-Cluster Sum of Dissimilarities Criterion.
14:30-15:00 Broes De Cat, Bart Bogaerts, Jo Devriendt and Marc Denecker. Model Expansion in the Presence of Function Symbols Using Constraint Programming.
15:00-15:30 Maria Andreina Francisco Rodriguez, Pierre Flener and Justin Pearson. Generation of Implied Constraints for Automaton-Induced Decompositions.
15:30-15:40 Coffee Break
15:40-17:00 Session A-9 Main Track (Poster Short Paper)    Machine Learning and Data Mining
  Wang Changlong and Feng Zhiyong. A Novel Combination of Reasoners for Ontology Classification. 
  Gianni Costa and Riccardo Ortale. Developments in Partitioning XML Documents by Content and Structure based on Combining Multiple Clusterings
  Yue Zhao, Jungang Xu and Yunjun Gao. A Parallel Algorithm for Bayesian Network Parameter Learning based on Factor Graph. 
  Liangxiao Jiang, Zhihua Cai, Chaoqun Li and Harry Zhang. Sampled Bayesian Network Classifiers for Class-Imbalance and Cost-Sensitive Learning. 
  Laurie Serrano, Maroua Bouzid, Thierry Charnois, Stephan Brunessaux and Bruno Grilheres. Events extraction and aggregation for open source intelligence: from text to knowledge. 
  Tongchun Du, Michael Cox, Donald Perlis, Jared Shamwell and Tim Oates. From Robots to Reinforcement Learning. 
  Jean-Charles Lamirel. Enhancing classification accuracy with the help of feature maximization metric. 
  Sultan Alhusain, Simon Coupland, Robert John and Maria Kavanagh. Design Pattern Recognition By Using Adaptive Neuro Fuzzy Inference System. 
17:00-17:30 Closing Remarks