Accepted Papers
Constraints, Satisfiability, and Search
Title
Authors
A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints
Thierry Petit, Nicolas Beldiceanu and Xavier Lorca
A Hybrid Recursive Multi-Way Number Partitioning Algorithm
Richard Korf
A Uniform Approach for Generating Proofs and Strategies for both True and False QBF Formulas
Alexandra Goultiaeva, Allen Van Gelder and Fahiem Bacchus
Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates
Jordan Thayer and Wheeler Ruml
Complete Approximation Algorithms for Cooperative Pathfinding Problems
Trevor Standley and Richard Korf
Constraint Programming on Infinite Data Streams
Arnaud Lallouet, Yat-Chiu Law, Jimmy H. M. Lee, Charles F. K. Siu
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable
Michael Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska and Frances Rosamond
Depth-Driven Circuit-Level Stochastic Local Search for SAT
Anton Belov, Matti Järvisalo and Zbigniew Stachniak
Dynamic SAT with Decision Change Costs: Formalization and Solutions
Daisuke Hatano and Katsutoshi Hirayama
Evaluations of Hash Distributed A* in Optimal Sequence Alignment
Yoshikazu Kobayashi, Akihiro Kishimoto and Osamu Watanabe
Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints
Peter Nightingale, Christopher Jefferson, Ian Miguel and Ian Gent
Finite-Length Markov Processes with Constraints
Francois Pachet, Pierre Roy and Gabriele Barbieri
Generalizing ADOPT and BnB-ADOPT
Patricia Gutierrez, Pedro Meseguer and William Yeoh
Heuristic Algorithms for Balanced Multi-way Number Partitioning
Jilian Zhang, Kyriakos Mouratidis and HweeHwa Pang
Kernels for Global Constraints
Serge Gaspers and Stefan Szeider
Large Hinge Width on Sparse Random Hypergraphs
Xiaxiang Lin, Tian Liu, Chaoyi Wang, Ke Xu and Yang Yuan
Minimization for Generalized Boolean Formulas
Edith Hemaspaandra and Henning Schnoor
Minimum Satisfiability and its Applications
Chumin Li, Zhu Zhu, Felip Manya and Laurent Simon
Nested Rollout Policy Adaptation for Monte Carlo Tree Search
Christopher Rosin
Probabilistic Satisfiability: Logic-based Algorithms and Phase Transition
Marcelo Finger and Glauber de Bona
Rational Deployment of CSP Heuristics
David Tolpin and Solomon Shimony
Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms
Federico Heras and Joao Marques-Silva
Real-Time Heuristic Search with Depression Avoidance
Carlos Hernandez and Jorge Baier
Real-time Opponent Modeling in Trick-taking Card Games
Jeffrey Long and Michael Buro
Real-time Solving of Quantified CSPs based on Monte-Carlo Game Tree Search
Satomi Baba, Yongjoon Joe, Atsushi Iwasaki and Makoto Yokoo
Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems
Zhaoyi Zhang, Wenbin Zhu, Wee-Chong Oon and Andrew Lim
Symmetries and Lazy Clause Generation
Geoffrey Chu, Maria Garcia de la Banda, Chris Mears and Peter Stuckey
Symmetry Breaking via LexLeader Feasibility Checkers
Pascal Van Hentenryck and Justin Yip
Tackling the Partner Units Configuration Problem
Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen
The Increasing Cost Tree Search for Optimal Multi-agent Pathfinding
Guni Sharon, Ron Zvi Stern, Meir Goldenberg and Ariel Felner
The Multi-Inter-Distance Constraint
Pierre Ouellet and Claude-Guy Quimper
Tractable Set Constraints
Manuel Bodirsky, Martin Hils and Alex Krimkevitch
Using Payoff-Similarity to Speed Up Search
Timothy Furtak and Michael Buro