7th CSPSAT3 Meeting

Information

  • Date
    • 2019 March 15th (Fri.) # 14 and 16 are expected for travel
  • Title
    • 7th CSPSAT3 Meeting
  • Venue
    • Room #421 on the 4th floor of Science and Technology Research Building 3, Rokkodai Campus, Kobe University Campus Map: Building #65
  • Address
    • 1-1 Rokkodai, Nada, Kobe 657-8501, Japan

Participants

  • Technische Universität Dresden
    • Johannes Fichte
  • École Centrale de Nantes
    • Morgan Magnin, Samuel Buchet
  • National Institute of Informatics
    • Katsumi Inoue
  • Tokyo Institute of Technology
    • Tianyu Chen
  • Yamanashi University
    • Hidetomo Nabeshima, Kazuhiro Kanbara, Riku Nakao
  • Nagoya University
    • Mutsunori Banbara
  • Kobe University
    • Naoyuki Tamura, Takehide Soh, Tetsuya Ikuta, Naoki Iino

Programme


03月15日(金)                                
10:00 - 11:00 Invited Talk
  Weighted Model Counting on the GPU by Exploiting Small Treewidth
  Johannes Fichte*, Markus Hecher, Stefan Woltran, Markus Zisser
11:00 - 11:30 Invited Talk
  Reachability and Attractors in Biological Systems Modelled using Automata Networks: Current Results and Challenges
  Morgan Magnin
11:30 - 12:00 Reachability Solving with SAT in Systems Biology
  Samuel Buchet*, Morgan Magnin, Olivier Roux
12:00 - 13:30 Lunch
13:30 - 13:55 Overview of sCOP and its Applications
  Takehide Soh
13:55 - 14:10 Studies on SAT
  陳天宇 (Tianyu Chen)
14:15 - 14:45 SAT ソルバーにおける学習節簡単化手法に基づくメタ探索戦略の提案
  中尾陸 (Riku Nakao),鍋島英知 (Hidetomo Nabeshima)
14:45 - 15:15 ポートフォリオ型並列 SAT ソルバーにおける適応型探索戦略
  神原和裕 (Kazuhiro Kanbara),鍋島英知 (Hidetomo Nabeshima)
15:30 - 16:00 正規制約のSAT符号化に関する追加実験結果の報告
  生田哲也 (Tetsuya Ikuta), 田村直之 (Naoyuki Tamura), 番原睦則 (Mutsunori Banbara), 宋剛秀 (Takehide Soh)
16:00 - 16:30 SATソルバーを用いた様相命題論理の充足可能性判定の改善
  飯野有軌 (Naoki Iino), 田村直之 (Naoyuki Tamura), 番原睦則 (Mutsunori Banbara), 宋剛秀 (Takehide Soh)
17:00 - 21:30 Discussion for Future Collaboration
* denotes presenter

Author: Takehide Soh

Created: 2019-03-08 金 10:37

Validate