Fourth CSPSAT & ASP Seminar
hosted jointly by CSPSAT2 and NII Joint Research Projects


General Information

Date : May 21st(Mon) - 22nd(Tue), 2012
Place : 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


May 21st (Mon)

13:00 -- 13:10 Opening
13:10 -- 14:40 Session (1)
On Neighborhood and Distance Between Qualitative Spatio-temporal Configurations [PDF]
Dominique D'Almeida, Mouny Samy Modeliar, and Nicolas Schwind
Inferring Thomas' modeling Interaction Graph and Parametrization from Process Hitting framework using ASP [PDF]
Maxime Folschette, Katsumi Inoue, Olivier Roux, Morgan Magnin, and Loic Pauleve
A Multi-Agent reasoning framework using Answer Set Programming in Dynamic environnement [PDF]
Tony Ribeiro
14:40 -- 15:10 Coffee break
15:10 -- 16:40 Session (2)
CSPSAT Project and Next [PDF]
Naoyuki Tamura
GlueMiniSat 2.2.5: A Fast SAT Solver with An Aggressive Acquiring Strategy of Glue Clauses [PDF]
Hibdetomo Nabeshima
A compact and efficient SAT encoding using a numeral system of any base and its empirical evaluation [PDF]
Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara, and Katsumi Inoue
16:40 -- 17:10 Coffee break
17:10 -- 18:10 Invited talk (1)
Compiling Model-Based Diagnosis to Boolean Satisfaction [PPSX]
Michael Codish
Abstract: This talk introduces an encoding of Model Based Diagnosis (MBD) to Boolean Satisfaction (SAT) focusing on minimal cardinality diagnosis. The encoding is based on a combination of sophisticated MBD preprocessing algorithms and SAT compilation techniques which together provide concise CNF formula. Experimental evidence indicates that our approach is superior to all existing algorithms for minimal cardinality MBD. In particular, we can determine, for the first time, minimal cardinality diagnoses for the entire standard ISCAS-85 benchmark. Our results open the way to improve the state-of-the-art on a range of similar MBD problems.
19:30 -- Dinner

May 22nd (Tue)

9:00 -- 10:00 Invited talk (2)
Manual and automatic knowledge representation in Answer Set Programming [PDF]
Chitta Baral
Abstract: Answer set programming (ASP) refers to logic programming with answer set semantics. It allows non-monotonic specification of knowledge and provides a simple syntax and semantics; yet it is quite expressive. In recent years a large body of building blocks (formal results, systems and applications) have been developed with respect to ASP. This has made ASP a language of choice for knowledge representation, reasoning and declarative problem solving. In this talk we will discuss the use of ASP in knowledge representation and touch upon a new dimension in knowledge representation. The new dimension is about representing knowledge when the representation is not done by a person but by a learning-based automated system that translates knowledge expressed in natural language to knowledge expressed in a formal language such as ASP. Such systems learn how to translate by analyzing examples of natural language sentences and their ASP translations and use that learning to translate new sentences. We discuss how knowledge representation in such a scheme poses new challenges.
10:00 -- 10:20 Coffee break
10:20 -- 11:20 Session (3)
Cooperative Path-finding as Satisfiability [PDF]
Pavel Surynek
Dynamic SAT with Decision Change Costs: Formalization and Solutions [PDF]
Daisuke Hatano and Katsutoshi Hirayama
11:30 Closing

Participants (alphabetical order)

Mutsunori Banbara Kobe University, Japan *
Chitta Baral Arizona State University, USA *
Michael Codish Ben-Gurion University of the Negev, Israel *
Maxime Folschette Ecole Centrale de Nantes, France *
Kenta Hanada Kobe University, Japan *
Daisuke Hatano Kobe University, Japan *
Katsutoshi Hirayama Kobe University, Japan *
Hiroshi Hosobe National Institute of Informatics, Japan *
Katsumi Inoue National Institute of Informatics, Japan *
Shin-ichi Minato Hokkaido University, Japan *
Hidetomo Nabeshima University of Yamanashi, Japan
Haruki Noritake Kobe University, Japan
Tony Ribeiro University of Angers, France *
Toshiki Saitoh Kobe University, Japan *
Atsushi Sakoda Kobe University, Japan *
Nicolas Schwind National Institute of Informatics, Japan *
Takehide Soh Kobe University, Japan *
Pavel Surynek Charles University in Prague, Czech Republic *
Naoyuki Tamura Kobe University, Japan *
Tomoya Tanjo Transdisciplinary Research Integration Center, Japan *
Tatsuhiro Tsuchiya Osaka University, Japan
Masahiro Yasugi Kyushu Institute of Technology, Japan

Note that the symbol * means he joins the dinner.


Time : May 21st (Mon) 19:30 --
Place:LAO FANG: A Chinese Dining (老房) [ぐるなび | 食べログ]
12-9, 2-chome, Shimoyamate-dori, Chuo, Kobe, Hyogo 650-0011
(〒650-0011 兵庫県神戸市中央区下山手通2-12-9)
Fee:6,000 JPY (for faculty),3,000 JPY (for student)