Abstract
In this paper we present tasplan, a complete planner for temporal logic programs. The planner receives a planning specification as input, having the form of a temporal ASP program, and obtains as output one or several alternative (shortest) plans, if the problem is solvable, or answers that no solution exists, otherwise. The tool allows different search strategies, including informed search algorithms if the user defines a domain-dependent heuristics with additional program rules.
Cite
CITATION STYLE
Cabalar, P., Rey, M., & Vidal, C. (2019). A Complete Planner for Temporal Answer Set Programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11805 LNAI, pp. 520–525). Springer Verlag. https://doi.org/10.1007/978-3-030-30244-3_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
