Seminar on SAT-based Constraint Satisfaction Techniques

Date

14th October 2008.

Venue

Presentation room 421,
Science and Technology Research Building,
Kobe University.

Access

1-1 Rokkodai-cho, Nada-ku, Kobe 657-8501, Japan.
Access Map

Participants

Prof. Naoyuki Tamura Kobe University, Japan
Prof. Katsumi Inoue National Institute of Informatics / The Graduate University for Advanced Studies, Japan
Prof. Mutsunori Banbara Kobe University, Japan
Prof. Hidetomo Nabeshima University of Yamanashi, Japan
Dr. Ateet Bhalla Technical University of Lisbon, Portugal
Prof. Tomio Kamada Kobe University, Japan
Mr. Tomoya Tanjo Kobe University, Japan
Mr. Kazuya Masuda Kobe University, Japan
Mr. Takehide Soh The Graduate University for Advanced Studies, Japan

Programme

9:30 - 11:30 Invited talk:
* Dr. Ateet Bhalla:
Backtracking Algorithms in SAT Solvers.
11:30 - 12:30 * Mr. Takehide Soh and Prof. Katsumi Inoue:
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem.
12:30 - 13:30 Lunch break
13:30 - 14:00 * Prof. Naoyuki Tamura, Mr. Tomoya Tanjo, and Prof. Mutsunori Banbara:
Sugar: A SAT-based CSP Solver.
14:00 - 14:30 * Mr. Tomoya Tanjo, Prof. Naoyuki Tamura, and Prof. Mutsunori Banbara:
Sugar++: A SAT-based MAX-CSP/COP Solver.
14:45 - 15:45 Discussion
* Speaker

CONTACT

Takehide Soh: soh at nii.ac.jp

Webmaster: Takehide Soh (E-mail soh at nii.ac.jp)
Last modified: 22nd Oct 2008