Paper Info
Title
A temporal logic programming approach to planning
Abstract
This paper presents an approach to performing artificial intelligence planning through temporal logic programming with Search Control Knowledge (SCK). First, the planning problem described with Planning Domain Description Language is modeled as a program m in Modeling, Simulation and Verification Language (MSVL). Second, the SCK is also specified with an MSVL program m ′ . Third, using the basic operation “and” in MSVL, a new MSVL program “mandm′” is obtained. Forth, with the compiler MC of MSVL, an executable binary code of program “mandm′” is obtained. Finally, planning result can be obtained via executing the executable code. Experimental results on selected benchmark planning domains from the International Planning Competition 2014 show that our approach is more effective in practice. Furthermore, the obtained plans are verified with the toolkit MSV so that a plan can be confirmed whether it is a reliable one. © 2019, Springer Science+Business Media, LLC, part of Springer Nature.
Year
DOI
Venue
2019
10.1007/s10878-019-00389-y
Journal of Combinatorial Optimization
Keywords
Field
DocType
MSVL,PDDL,Planning,Search control knowledge,Temporal logic
Temporal logic programming,Mathematical optimization,Programming language,Artificial intelligence planning,Planning domain description language,Binary code,Compiler,Temporal logic,Mathematics,Planning Domain Definition Language,Executable
Journal
Volume
Issue
ISSN
38.0
2.0
1382-6905
Citations 
PageRank 
References 
0
0.34
21
Authors
5
Name
Order
Citations
PageRank
Kai Yang182.58
Cong Tian232848.72
Nan Zhang31105.59
Zhenhua Duan465878.37
Du Hongwei534341.34