10th CSPSAT Seminar

Overview

Title	10th CSPSAT Seminar
Date	November 14, 15 2016
Venue	Room #421 on the 4th floor of Science and Technology Research Building 3,
	Rokkodai Campus, Kobe University [Campus Map: Building #23]
Address	1-1 Rokkodai, Nada, Kobe 657-8501, Japan

Programme

November 14
14:30-15:30	(Invited Talk)
	Trends in SAT solving: what are the recent progresses?　[PDF]
	Daniel Le Berre
	[Abstract] The "SAT revolution" which occurred thanks to the design of the Conflict Driven Clause Learning (CDCL) solvers is now 15 years old. What are the main recent advances in the area of SAT solving? What are the main challenges remaining? This talk will summarize recent advances on SAT solving in the broad sense (including related optimization problems) and provide some open problems regarding SAT solving.
15:40-15:55	(Talk)
	Recent Research Topics of Our Group　[PDF]
	Naoyuki Tamura
15:55-16:40	Evaluation of Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings　[PDF]
	Takehide Soh
16:50-17:50	(Invited Talk)
	Two-sided matching: optimization under incentive, stability, and distributional constraints　[PDF]
	Makoto Yokoo
	[Abstract] The theory of two-sided matching (e.g., assigning residents to hospitals, students to schools) has been extensively developed, and it has been applied to design clearinghouse mechanisms in various markets in practice. As the theory has been applied to increasingly diverse types of environments, however, researchers and practitioners have encountered various forms of distributional constraints. As these features have been precluded from consideration until recently, they pose new challenges for market designers. One example of such distributional constraints is a minimum quota, e.g., school districts may need at least a certain number of students in each school in order for the school to operate. In this talk, I present an overview of research on designing mechanisms that work under distributional constraints.
18:00-19:00	(Invited Talk)
	Refining Clause Reduction Heuristics in CDCL Solvers　[PDF]
	Hidetomo Nabeshima
19:45-21:45	Social Dinner

November 15
09:30-10:30	(Invited Talk)
	Recent Topics on BDDs/ZDDs: Implicit Enumeration and Compressed Indexing　[PDF]
	Shin-ichi Minato
10:40-11:40	(Invited Talk)
	MaxSAT Encoding for MC-net/PDT-based Coalition Structure Generation Problem　[PDF]
	Miyuki Koshimura, Kazuki Nomoto, Yuko Sakurai, and Makoto Yokoo
13:00-14:00	(Invited Talk)
	Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations　[PDF]
	Katsutoshi Hirayama
14:10-15:10	(Invited Talk)
	Parallel SAT solving guided by MaxSAT oracles on GPU　[PDF]
	Sophie Tourret* and Katsumi Inoue
15:20-16:20	(Invited Talk)
	Representative Solutions for Multi-Objective Constraint Optimization Problems　[PDF]
	Nicolas Schwind, Tenda Okimoto, Maxime Clement, and Katsumi Inoue

Participants (25 persons from 11 institutions)

\(^{*}\) denotes members who will attend the social dinner on 14th.

CRIL-CNRS/Université d’Artois
- Daniel Le Berre\(^{*}\)
Hokkaido University
- Shin-ichi Minato\(^{*}\)
National Institute of Informatics
- Katsumi Inoue, Sophie Tourret\(^{*}\)
National Institute of Advanced Industrial Science and Technology
- Nicolas Schwind, Takashi KITAMURA, Jun Inoue ¹
SONAR Co., Ltd.
- Kotaro Okazaki
The University of Electro-Communications
- Takahisa Toda\(^{*}\)
Yamanashi University
- Hidetomo Nabeshima\(^{*}\)
Nagoya University
- Masahiko Sakai ¹
Kobe University
- Katsutoshi Hirayama\(^{*}\), Naoyuki Tamura\(^{*}\), Mutsunori Banbara\(^{*}\), Takehide Soh\(^{*}\), Masahiro Kawahara, Tatsuya Sako, Tomoya Sunda, Yushi Minami, Motokazu Yoshitama, Naoki Hayama
National Institute of Technology, Tokuyama College
- Noriaki Chikara\(^{*}\) ²
Kyushu University
- Makoto Yokoo, Miyuki Koshimura\(^{*}\), Aolong Zha\(^{*}\)

Social Dinner

Date and Time: November 14th (Mon.) 19:45 –
Restaurant: Uoku (魚喰)
Address: 4-18, 3-chome, Nagate-cho, Nada-ku, Kobe, Hyogo, 657-0027
TEL: (078) 842-5030
URL: http://uoku.jp/
Charge: 7,000 JPY (for faculty)，3,000 JPY (for student)

Footnotes:

Participate to Serminar on 14th.

On 14th, will arrive after 4 p.m.