14:00 -- 14:10 | opening |
14:10 -- 15:25 | invited talk |
Answer Set Programming, the Solving Paradigm of Knowledge Representation and Reasoning: Overview and recent developments
[abstract]
[PDF]
Torsten Schaub |
|
15:25 -- 15:45 | coffee break |
15:45 -- 16:45 | session (1) |
GlueMiniSat 2.2.5: A Fast SAT Solver with An Aggressive Acquiring Strategy of Glue Clauses
[PDF]
Hidetomo Nabeshima, Koji Iwanuma, and Katsumi Inoue |
|
A Simple Implementation of a Partial MaxSAT Solver with MiniSat
[PDF]
[PPTX]
Miyuki Koshimura |
|
16:45 -- 17:00 | coffee break |
17:00 -- 18:30 | session (2) |
Solving Constraint Satisfaction Problems by a SAT Solver
[PDF]
Naoyuki Tamura |
|
DNF Hypotheses in Bottom-directed ILP
[PDF]
Katsumi Inoue |
|
Query-driven Coordination of Multiple Answer Sets
[PDF]
Gauvain Bourgne and Katsumi Inoue |
|
19:30 -- | Party |
10:00 -- 11:00 | session (3) |
A compact and efficient SAT encoding of finite CSP based on a numeral system of integers
[PDF] Tomoya Tanjo, Naoyuki Tamura, and Mutsunori Banbara |
|
Dynamic SAT with Decision Change Costs: Formalization and Solutions
[PDF]
[PPTX] Daisuke Hatano and Katsutoshi Hirayama |
|
11:00 -- 11:20 | coffee break |
11:20 -- 12:00 | open discussion |
12:00 | closing |
Xuanye An | Kyushu University | * |
Mutsunori Banbara | Kobe University | * |
Gauvain Bourgne | National Institute of Informatics | * |
Taisuke Funakoshi | Kobe University | |
Daisuke Hatano | Kobe University | * |
Katsutoshi Hirayama | Kobe University | * |
Kengo Honjo | Kobe University | |
Katsumi Inoue | National Institute of Informatics | * |
Miyuki Koshimura | Kyushu University | * |
Haruki Matsunaka | Kobe University | |
Hedetomo Nabeshima | University of Yamanashi | * |
Haruki Noritake | Kobe University | |
Torsten Schaub | University of Potsdam | * |
Takehiro Shibutani | Kobe University | |
Takehide Soh | Transdisciplinary Research Integration Center | * |
Pavel Surynek | Charles University in Prague | * |
Naoyuki Tamura | Kobe University | * |
Tomoya Tanjo | Kobe University | * |