• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Research and Development on Multi-objective Optimization Solver based on Advanced Knowledge Representation and Reasoning Techniques

Research Project

Project/Area Number 18K11242
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Review Section Basic Section 60050:Software-related
Research InstitutionNagoya University

Principal Investigator

Banbara Mutsunori  名古屋大学, 情報学研究科, 教授 (80290774)

Co-Investigator(Kenkyū-buntansha) 宋 剛秀  神戸大学, 情報基盤センター, 准教授 (00625121)
田村 直之  神戸大学, 情報基盤センター, 教授 (60207248)
Project Period (FY) 2018-04-01 – 2021-03-31
Project Status Completed (Fiscal Year 2020)
Budget Amount *help
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2020: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2019: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2018: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Keywords解集合プログラミング / 最適化 / 時間割問題 / 多目的最適化
Outline of Final Research Achievements

Answer Set Programming (ASP), derived from Logic Programming, is an approach to declarative problem solving. We develop an approach to solving multi-objective optimization problems based on ASP. We show the effectiveness of our approach by empirically contrasting it to more dedicated implementations, through real-world problems such as timetabling.

Academic Significance and Societal Importance of the Research Achievements

近年,解集合プログラミング技術は大きく進歩し,今後ますますの発展が見込まれる.本研究課題の成果は,高度な知識表現・推論・最適化を必要とするアプリケーション開発において,高性能かつ高機能な推論基盤を提供するものであり,様々な研究分野での活用が期待できる.例えば,多目的最適化は人工知能における選考 (preference) とも密接な関係があり,この研究分野への波及効果も大きく期待できる.

Report

(4 results)
  • 2020 Annual Research Report   Final Research Report ( PDF )
  • 2019 Research-status Report
  • 2018 Research-status Report
  • Research Products

    (21 results)

All 2020 2019 2018 Other

All Int'l Joint Research (4 results) Journal Article (6 results) (of which Int'l Joint Research: 1 results,  Peer Reviewed: 4 results,  Open Access: 2 results) Presentation (11 results) (of which Int'l Joint Research: 2 results)

  • [Int'l Joint Research] ポツダム大学(ドイツ)

    • Related Report
      2020 Annual Research Report
  • [Int'l Joint Research] ポツダム大学(ドイツ)

    • Related Report
      2019 Research-status Report
  • [Int'l Joint Research] ポツダム大学(ドイツ)

    • Related Report
      2018 Research-status Report
  • [Int'l Joint Research] CRIL(フランス)

    • Related Report
      2018 Research-status Report
  • [Journal Article] CEGARと反例の共有を用いたSAT型CSPソルバーの並列化方法の考察2020

    • Author(s)
      宋剛秀, 鍋島英知, 番原睦則, 田村直之, 井上克巳
    • Journal Title

      人工知能学会研究会資料

      Volume: SIG-FPAI-B903-02 B5(03) Pages: 6-11

    • NAID

      130008061554

    • Related Report
      2019 Research-status Report
  • [Journal Article] Fun-sCOP2019

    • Author(s)
      Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Naoyuki Tamura
    • Journal Title

      XCSP3 Competition 2019 Solver Description

      Volume: -

    • Related Report
      2019 Research-status Report
  • [Journal Article] Recent Advances in SAT Solvers and their Utilization Technologies.2018

    • Author(s)
      宋 剛秀、番原 睦則、田村 直之、鍋島 英知
    • Journal Title

      Computer Software

      Volume: 35 Issue: 4 Pages: 72-92

    • DOI

      10.11309/jssst.35.72

    • NAID

      130007552525

    • ISSN
      0289-6540
    • Year and Date
      2018-10-25
    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Journal Article] A SAT Encoding of Pseudo-Boolean Constraints via Boolean Cardinality Constraints2018

    • Author(s)
      南雄之, 宋剛秀, 番原睦則, 田村直之
    • Journal Title

      Computer Software

      Volume: 35 Issue: 3 Pages: 3_65-3_78

    • DOI

      10.11309/jssst.35.3_65

    • NAID

      130007487601

    • ISSN
      0289-6540
    • Year and Date
      2018-07-25
    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] teaspoon: Solving the Curriculum-Based Course Timetabling Problems with Answer Set Programming2018

    • Author(s)
      Mutsunori Banbara, Katsumi Inoue, Benjamin Kaufmann, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Philipp Wanko
    • Journal Title

      Annals of Operations Research

      Volume: - Issue: 1 Pages: 3-37

    • DOI

      10.1007/s10479-018-2757-7

    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] SAT技術を用いたペトリネットのデッドロック検出手法の提案2018

    • Author(s)
      寸田智也, 宋剛秀, 番原睦則, 田村直之, 井上克巳
    • Journal Title

      情報処理学会論文誌

      Volume: 59(9) Pages: 1749-1760

    • NAID

      130007425532

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Presentation] 車両装備仕様問題に対する解集合プログラミングの適用2020

    • Author(s)
      竹内頼人, 田村直之, 番原睦則
    • Organizer
      日本ソフトウェア科学会第37回大会
    • Related Report
      2020 Annual Research Report
  • [Presentation] 解集合プログラミングを用いた配電網問題の解法に関する一考察2020

    • Author(s)
      山田健太郎, 湊真一, 番原睦則
    • Organizer
      日本ソフトウェア科学会第37回大会
    • Related Report
      2020 Annual Research Report
  • [Presentation] SATソルバーを用いた一層平面配置配線問題の解法に関する考察2020

    • Author(s)
      三嶋哲平, 宋剛秀, 田村直之
    • Organizer
      日本ソフトウェア科学会第37回大会
    • Related Report
      2020 Annual Research Report
  • [Presentation] 解集合プログラミングによる様相命題論理Kの充足可能性判定2020

    • Author(s)
      飯野有軌, 田村直之, 宋剛秀, 番原睦則, 井上克巳
    • Organizer
      人工知能学会全国大会(第34回)
    • Related Report
      2020 Annual Research Report
  • [Presentation] コスト制約つき組合せ問題に対するZDDを用いた高速な解列挙手法2020

    • Author(s)
      湊真一, 番原睦則, 堀山貴史, 川原純, 瀧川一学, 山口勇太郎
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2020 Annual Research Report
  • [Presentation] 正規制約に対するSAT符号化手法の提案と評価 (ポスター)2020

    • Author(s)
      生田哲也, 田村直之, 宋剛秀, 番原睦則
    • Organizer
      第22回プログラミングおよびプログラミング言語ワークショップ (PPL2020)
    • Related Report
      2019 Research-status Report
  • [Presentation] 解集合ソルバーを用いた様相命題論理の充足可能性判定 (ポスター)2020

    • Author(s)
      飯野有軌, 田村直之, 宋剛秀, 番原睦則, 井上克巳
    • Organizer
      第22回プログラミングおよびプログラミング言語ワークショップ (PPL2020)
    • Related Report
      2019 Research-status Report
  • [Presentation] A SAT-based CSP Solver sCOP and its Results on 2018 XCSP3 Competition2019

    • Author(s)
      Takehide Soh, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura
    • Organizer
      2019年度人工知能学会全国大会(第33回)
    • Related Report
      2019 Research-status Report
  • [Presentation] alldifferent制約のブール基数制約への符号化手法の提案とクイーングラフ彩色問題への応用2019

    • Author(s)
      大野周亮, 番原睦則, 宋剛秀, 田村 直之
    • Organizer
      人工知能基本問題研究会(第109回)
    • Related Report
      2018 Research-status Report
  • [Presentation] teaspoon: Solving the Curriculum-Based Course Timetabling Problems with Answer Set Programming2018

    • Author(s)
      Mutsunori Banbara, Katsumi Inoue, Benjamin Kaufmann, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura, and Philipp Wanko
    • Organizer
      The 28th International Conference on Automated Planning and Scheduling (ICAPS 2018)
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] sCOP: SAT-based Constraint Programming System2018

    • Author(s)
      Takehide Soh, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura
    • Organizer
      XCSP3 Competition 2018
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research

URL: 

Published: 2018-04-23   Modified: 2022-01-27  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi