Presentation 2000/1/13
Implementing an Action Language using a SAT Solver
Hidetomo Nabeshima, Katsumi Inoue, Hiromasa Haneda,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In recent years the research of planning algorithm has advanced drastically. First of all, the approach encodes plan search space into the data structure called planning graph. Next the graph is transformed into the satisfiability problem(SAT), and then is solved by a high-performance SAT solver. In this study, we implemented an action language processing system AMP on the basis of planning graph and the plan extraction by a SAT solver. Using this system, it becomes possible to do planning and model generation(estimation of the initial state)for a domain description written in the action language A.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Action languages / planning / SAT / planning-graph
Paper # AI99-84
Date of Issue

Conference Information
Committee AI
Conference Date 2000/1/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Implementing an Action Language using a SAT Solver
Sub Title (in English)
Keyword(1) Action languages
Keyword(2) planning
Keyword(3) SAT
Keyword(4) planning-graph
1st Author's Name Hidetomo Nabeshima
1st Author's Affiliation Graduate School of Science and Technology, Kobe Univesity()
2nd Author's Name Katsumi Inoue
2nd Author's Affiliation Graduate School of Science and Technology, Kobe Univesity:Daprtment of Electrical and Electronics Engineering, Faculty of Engineering, Kobe University
3rd Author's Name Hiromasa Haneda
3rd Author's Affiliation Graduate School of Science and Technology, Kobe Univesity:Daprtment of Electrical and Electronics Engineering, Faculty of Engineering, Kobe University
Date 2000/1/13
Paper # AI99-84
Volume (vol) vol.99
Number (no) 534
Page pp.pp.-
#Pages 8
Date of Issue