Research and Development on Multi-objective Optimization Solver based on Advanced Knowledge Representation and Reasoning Techniques
Project/Area Number |
18K11242
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Review Section |
Basic Section 60050:Software-related
|
Research Institution | Nagoya University |
Principal Investigator |
|
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)
Research Products
(21 results)
-
-
-
-
-
-
[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
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-