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

Research on an Integrated System for Fast SAT Planning

Research Project

Project/Area Number 12680384
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Intelligent informatics
Research InstitutionKobe University

Principal Investigator

INOUE Katsumi  Kobe University, Engineering, Associate Professor, 工学部, 助教授 (10252321)

Co-Investigator(Kenkyū-buntansha) NABESHIMA Hidetomo  Yamanashi University, Engineering, Assistant Professor, 工学部, 助手 (10334848)
HANEDA Hiromasa  Kobe University, Engineering, Professor, 工学部, 教授 (10031113)
Project Period (FY) 2000 – 2001
Project Status Completed (Fiscal Year 2001)
Budget Amount *help
¥3,200,000 (Direct Cost: ¥3,200,000)
Fiscal Year 2001: ¥1,000,000 (Direct Cost: ¥1,000,000)
Fiscal Year 2000: ¥2,200,000 (Direct Cost: ¥2,200,000)
Keywordsplanning / satisfiability (SAT) / reasoning about change / SAT planning / action language / planning graph / アクション言語 / SATソルバ / SATプランニング / プランニンググラフ / 充足可能性判定
Research Abstract

SAT planning is a fast planning method which converts a planning problem into a satisfiability (SAT) problem and extracts a plan by solving the SAT problem using a fast SAT solver. In this research, we have developed an integrated action language processing system AMP to perform fast SAT planning on domain descriptions described in action languages : The contributions of the research can be summerized as follows.
1. We have developed several algorithms to convert domain descriptions described in action languages into SAT problems. In particular, we have considered an algorithm which transforms planning problems involving nondeterministic actions into SAT problems.
2. We have implemented several planning engines in AMP. Using planning graphs as data structures, we have developed forward/backward/mixed graph expansion algorithms to perform planning as fast as possible. We have also designed our system to have multiple SAT solvers for SAT planning. Depending on the feature of a problem, some SAT solvers perform better than others.
3. We have considered learning algorithms for speed-up planning. Given observations that describe fluent values after performing action sequences, learning algorithms induce causal relationships between actions and their effects.
4. AMP has been implemented in Java, and has an ability to draw planning graphs for interactive uses. Experimental results with big benchmark problems show that the performance of AMP is comparable to one of the fastest planner in the world. Unlike previous systems, however, AMP can interpret a description in an action language directly, and can answer queries for not only planning but model generation efficiently.

Report

(3 results)
  • 2001 Annual Research Report   Final Research Report Summary
  • 2000 Annual Research Report
  • Research Products

    (22 results)

All Other

All Publications (22 results)

  • [Publications] Katsumi Inoue: "Learning Abductive and Nonmonotoic Logic Programs"Abduction and Induction : Essay on their Relation and Integration. 213-231 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Katsumi Inoue: "A Simple Characterization of Extended Abduction"Lecture Notes in Artificial Intelligence. 1861. 718-732 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Hidetomo Nabeshima: "Implementing on Action Language using a SAT solver"IEEE Int'l Conf.Tools with Artificial Intelligence. 12. 96-103 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chiaki Sakama: "Prioritized Logic Programming and its Application to Commonsense Reasoning"Artificial Intelligence. 123. 185-222 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 鍋島 英知: "プランニンググラフとSATプランニング"人工知能学会誌. 16. 605-610 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Katsumi Inoue: "Induction, Abduction, and Consequence-Finding"Lecture Notes in Artificial Intelligence. 2157. 65-79 (2001)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Hidetomo Nabeshima: "Implementing an Action Language using a SAT Solver"Proceedings of the Twelfth IEEE International Conference on Tools with Artificial Intelligence. 96-103 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Katsumi Inoue: "Learning Abductive and Nonmonotonic Logic Programs"Abduction and Induction : Essays on their Relation and Integration. 213-231 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Katsumi Inoue: "A Simple Characterization of Extended Abduction"Lecture Notes in Artificial Intelligence. 1861. 718-732 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Chiaki Sakama: "Prioritized Logic Programming and its Application to Commonsense Reasoning"Artificial Intelligence. 123(1-2). 185-222 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Hidetomo Nabesima: "Planning Graph and SAT Planning"Journal of Japanese Society for Artificial Intelligence. 16(5). 605-610 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Katsumi Inoue: "Inverse Entailment for Full Clausal Theories"LICS-2001 Workshop on Logic and Learning. (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Katsumi Inoue: "Induction, Abduction, and Consequence-finding"Lecture Notes in Artificial Intelligence. 2157. 65-79 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Katsumi Inoue: "Controlling Speculative Computation in Multi-Agent Environments"Proceedeings of the Third International Workshop on Computational Logic in Multi-Agent Systems. 9-18 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] Katsumi Inoue: "Automated Abduction"Lecture Notes in Artificial Intelligence. (to appear). (2002)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 鍋島 英知: "プランニンググラフとSATプランニング"人工知能学会誌. 16・5. 605-610 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] Katsumi Inoue: "Induction, Abduction, and Consequence-Finding"Lecture Notes in Artificial Intelligence. 2157. 65-79 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] Katsumi Inoue: "Automated Abduction"Lecture Notes in Artificial Intelligence. (to appear). (2002)

    • Related Report
      2001 Annual Research Report
  • [Publications] Katsumi Inoue: "Learning Abductive and Nonmonotonic Logic Programs"Abduction and Induction : Essays on their Relation and Integration. 213-231 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Katsumi Inoue: "A Simple Characterization of Extended Abduction"Lecture Notes in Artificial Intelligence. 1861. 718-732 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Hidetomo Nabeshima: "Implementing an Action Language using a SAT Solver"IEEE Int'l Conf.on Tools with Artificial Intelligence. 12. 96-103 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Chiaki Sakama: "Prioritized Logic Programming and its Application to Commonsense Reasoning"Artificial Intelligence. 123・1〜2. 185-222 (2000)

    • Related Report
      2000 Annual Research Report

URL: 

Published: 2000-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi