The Joint Meeting of the 1st CSPSAT2 Meeting and NII Collaborative Research Projects

CSPSAT2

Information

Date: July 12 - 13, 2012
Venue: Onomichi-ryokan, Senkoji-sanso
Address: 15-20, Nishitsuchido-cho, Onomichi, Hiroshima

Local Information

Programme

Thursday, July 12

09:30 - 10:00 Opening -- Project Introductions 10 min x 3
CSPSAT2 Project [PDF]
Naoyuki Tamura
NII Collaborative Research Project:
Research on Constraint Answer Set Programming Using SAT Techniques [PDF]
Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura, Takehide Soh and *Tomoya Tanjo
NII Collaborative Research Project:
Consequence Finding and SAT/MaxSAT Solving in a Distributed Environment [PDF] [PPTX]
Katsutoshi Hirayama
10:15 - 11:45 Technical Presentations 30 min. x 3
ASP Modules for Agent Reasoning in Dynamic Environment [PDF]
Tony Ribeiro and Katsumi Inoue
On Dynamic ASP-based Multi-agent Systems [PDF] [ODP]
Newfel Messouci and Katsumi Inoue
Finding Minimal Generalization for Conjunctive Queries [PDF]
Pham Le Thi Anh Thu and Katsumi Inoue
11:45 - 13:00 Lunch
13:00 - 15:00 Technical Presentations 30 min. x 4
A Heuristic Search for Inverse Subsumption in Full Clausal Theories [PDF]
Yoshitaka Yamamoto, Katsumi Inoue, and Koji Iwanuma
Merging Qualitative Constraint Networks [PDF]
Jean-François Condotta, Souhila Kaci, Pierre Marquis, and *Nicolas Schwind
Constraint Satisfaction for Bayesian Networks [PDF] [PPT] Hei Chan and Adnan Darwiche
Algorithms for MO-COP/DCOP [PDF] [PPTX]
Tenda Okimoto, Yongjoon Joe, Toshihiro Matsui, Katsutoshi Hirayama, Atsushi Iwasaki and Makoto Yokoo
15:00 - 15:30 coffee break
15:30 - 17:00 Technical Presentations (in Japanese) 30 min. x 2
Constructing Packing Arrays by SAT Encoding [PDF]
Haruki Noritake, Mutsunori Banbara, Naoyuki Tamura, and Katsumi Inoue
Curriculum based Course Timetabling Problems into Pseudo-Boolean Optimization Problems [PDF]
Mina Suzue, Naoyuki Tamura, Mutsunori Banbara, Takehide Soh, and Itsuo Hatono
19:00 - Dinner

Friday, July 13

09:00 - 10:00 Technical Presentations (in Japanese) 30 min. x 2
Asynchronous Backtracking Algorithm for the Clause-set Partitioned Distributed SAT [PDF] [PPTX]
Shotaro Shimomaki and Katsutoshi Hirayama
GlueMiniSat 2.2.6: Restart Heuristics for Accelerating Conflicts [PDF]
Hidetomo Nabeshima
10:15 - 12:15 Discussion
  • Research Plans etc ...

Participants

Kobe University
Naoyuki Tamura, Katsutoshi Hirayama, Mutsunori Banbara, Takehide Soh, Daisuke Hatano,
Shotaro Shimomaki, Mina Suzue, Haruki Noritake
National Institute of Informatics
Katsumi Inoue, Nicolas Schwind
University of Yamanashi
Hidetomo Nabeshima, Yoshitaka Yamamoto
Transdisciplinary Research Integration Center
Hei Chan, Tomoya Tanjo
Kyushu University
Tenda Okimoto
Université d'Angers
Tony Ribeiro
Ho Chi Minh City University of Information Technology
Pham Le Thi Anh Thu
Université Pierre et Marie Curie
Newfel Messouci

Access to the venue "Senkoji-sanso"

From Tokyo Station (about 240 min. and 17,290 yen)
Tokyo St.
| (Shinkansen-Nozomi about 220 min.)
Fukuyama St.
| (Shinkansen-Kodama about 20 min.)
Shin-Onomichi St.

From Shin-Kobe Station (about 70 min. and 7,650 yen)
Shin-Kobe St.
| (Shinkansen-Nozomi about 50 min.)
Fukuyama St.
| (Shinkansen-Kodama about 20 min.)
Shin-Onomichi St.

From Hakata Station (about 120 min. and 10,580 yen)
Hakata St.
| (Shinkansen-Nozomi about 70 min.)
Hiroshima St.
| (Shinkansen-Kodama about 40 min.)
Shin-Onomichi St.

Please take a taxi from the south exit of Shin-Onomichi Station.
It will take more 10 min. and cost 1,000 yen.

Until 5:15 p.m., there is another way of using ropeway from Onomichi St. but it is inconvenient.

Please refer the following web sites for more details.
Access to the Shin-Onomichi Station
Access to the Senkoji-sanso (in Japanese)

Other remarks