Domain-dependent knowledge in answer set planning

DOI10.1145/1183278.1183279MaRDI QIDQ5277758zbMATH OpenOpenAlexFDO

Authors

Publication date 12 July 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0207023

zbMATH Keywords

planningreasoning about actionsprocedural knowledgecontrol knowledgeanswer set planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Logic in artificial intelligence (68T27)

Abstract: In this paper we consider three different kinds of domain-dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative and relies on the language of logic programming with answer set semantics (AnsProlog*). AnsProlog* is designed to plan without control knowledge. We show how temporal, procedural and HTN-based control knowledge can be incorporated into AnsProlog* by the modular addition of a small number of domain-dependent rules, without the need to modify the planner. We formally prove the correctness of our planner, both in the absence and presence of the control knowledge. Finally, we perform some initial experimentation that demonstrates the potential reduction in planning time that can be achieved when procedural domain knowledge is used to solve planning problems with large plan length.

Recommendations

• scientific article; zbMATH DE number 1884393
• Logic Programming
• Using temporal logics to express search control knowledge for planning
• Planning in answer set programming using ordered task decomposition
• Encoding domain and control knowledge for propositional planning

Cited in

(13)

• Reasoning about actions with Temporal Answer Sets
• Comparing planning domain models using answer set programming
• Encoding domain and control knowledge for propositional planning
• scientific article; zbMATH DE number 1884393 (Why is no real title available?)
• plasp 3: towards effective ASP planning
• Approximation of action theories and its application to conformant planning
• Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
• Doctoral Consortium Extended Abstract: Planning with Concurrent Transaction Logic
• Logic Programming for Multiagent Planning with Negotiation
• scientific article; zbMATH DE number 2166725 (Why is no real title available?)
• scientific article; zbMATH DE number 1890629 (Why is no real title available?)
• Logic programming for finding models in the logics of knowledge and its applications: a case study
• Logic Programming

This page was built for publication: Domain-dependent knowledge in answer set planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277758)