Tuesday, July 7
2:30 PM	Depart LAX
6:00 PM	Arrive Lake Arrowhead
7:00 PM	Dinner
Wednesday, July 8
7:00 - 8:30	Breakfast
8:30 - 8:35	Welcome
8:35 - 9:40	Invited Talk: Jeff Orkin, Abstractions in AI for Games
9:40 - 10:30	Reformulation & Planning
	L.Chrpa, R. Barták. Reformulating Planning Problems by Eliminating Unpromising Actions
	A. Rendl, I. Miguel, I. Gent, P. Gregory. Common Subexpressions in Constraint Models of Planning Problems
10:30 - 11:00	Coffee
11:00 - 12:40	Abstraction & Modeling
	L. Saitta, C. Henegar, J-D Zucker. Abstracting Complex Interaction Networks
	D. Caragea, V. Bahirwani, W. Aljandal, W. Hsu. Ontology-Based Link Prediction in the LiveJournal Social Network
	A. Rendl, I. Miguel, I. Gent, C. Jefferson. Automatically Enhancing Constraint Model Instances during Tailoring
	R. Chenouard, L. Granvilliers, R. Soto. Rewriting Constraint Models with Metamodels
12:40 - 2:00	Lunch
2:00 - 3:15	ARA & Diagnosis
	R. Abreu, A.J.C. van Gemund. A Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis
	J. Liu, L. Kuhn, J. de Kleer. Computationally Efficient Tiered Inference for Multiple Fault Diagnosis
	A. Feldman, G. Provan, J. de Kleer, L. Kuhn, A. van Gemund. Automated Redesign with the General Redesign Engine
3:15 - 3:45	Coffee
3:45 - 5:00	Reformulation & SAT
	Anbulagan, A. Grastien. Importance of Variables Semantic in CNF Encoding of Cardinality Constraints
	P. Jégou, L. Paris. A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances
	M. Velev, P. Gao. Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
5:00 - 5:15	Stretch Break
5:15 - 6:05	Interval Abstraction and Abstracting Intervals
	N. Berger, L. Granvilliers. Some Interval Approximation Techniques for MINLP
	P. Revesz. Tightened Transitive Closure of Integer Addition Constraints
6:05 - 7:00	Wine & cheese reception
7:00 - 8:30	Dinner
Thursday, July 9
7:00 - 8:30	Breakfast
8:30 - 8:35	Welcome
8:35 - 9:40	Invited Talk: Michael Genesereth, Reformulation in General Game Playing
9:40 - 10:30	Abstraction & Consistency
	G.Torta, D.T. Dupré Abductive Problem Solving with Abstractions
	T. Hinrichs, J-Y Kao, M. Genesereth. Inconsistency-tolerant Reasoning with Classical Logic and Large Databases
10:30 - 11:00	Coffee
11:00 - 12:40	ARA & Constraint Programming
	M. Arangu, M. A. Salido, F. Barber. 2-C3: From Arc-Consistency to 2-Consistency
	A. Grayland, I. Miguel, C. Roney-Dougal. Confluence of reduction rules for lexicographic ordering constraints
	A. Grayland, I. Miguel, C. Roney-Dougal. In search of a better method to break row and column symmetries
	I. Gent, P. McKay, I. Miguel, P. Nightingale, S. Huczynska. Modelling Equidistant Frequency Permutation Arrays in Constraints
12:40 - 2:00	Lunch
2:00 - 6:30	Open Afternoon
6:30 - 8:00	Dinner
Friday, July 10
7:00 - 8:30	Breakfast
8:30 - 8:35	Welcome
8:35 - 9:40	Invited Talk: Rob Holte, Abstraction and Search
9:40 - 10:30	Abstraction & Planning
	S. Srivastava, N. Immerman, S. Zilberstein. Abstract Planning with Unknown Object Quantities and Properties
	R. Barták, D. Toropila. Integrating Constraint Models for Sequential and Partial-Order Planning
10:30 - 11:00	Coffee
11:00 - 12:40	Abstraction & State-Space Search
	A. Felner, N. Sturtevant, J. Schaeffer Abstraction-Based Heuristics with True Distance Computations
	S, Zilles, R. Holte Downward Path Preserving State Space Abstractions
	R. Zhou, E. Hansen Dynamic State-Space Partitioning in External-Memory Graph Search
	T. Breyer, R. Korf 1.6-bit Pattern Databases
12:40 - 2:00	Lunch
2:00 - 3:15	Approximation and Reformulation for Constraint Programming
	J. Vion, R. DEBRUYNE. Light Algorithms for Maintaining Max-RPC During Search
	G. Katsirelos, T. Walsh Posting Static Symmetry Breaking Constraints Dynamically
	S. Epstein, X. Li. Cluster Graphs as Abstractions for Constraint Satisfaction Problems
3:15 - 3:45	Coffee
3:45 - 5:00	Abstraction & Parallel Search
	E. Burns, S. Lemons, R. Zhou, W. Ruml Parallel Best-First Search: Optimal and Suboptimal Solutions
	S. Edelkamp, D. Sulewski Parallel State Space Search on the GPU
5:00 - 5:15	Stretch Break
5:15 - 6:05	Approximation by Forgetting
	K. Waugh, M. Zinkevich, M. Johanson, M. Kan, D. Schnizlein, M. Bowling. A Practical Use of Imperfect Recall
	S. Richter, J.T. Thayer, W. Ruml The Joy of Forgetting: Faster Anytime Search via Restarting
6:30 - 8:00	Dinner
	After dinner bus departs for Pasadena