Planning as tabled logic programming

DOI10.1017/S1471068415000216MaRDI QIDQ4592996zbMATHOpenAlexFDO

Authors Neng-Fa Zhou, Roman Bartak, Agostino Dovier

Publication date 9 November 2017

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Abstract: This paper describes Picat's planner, its implementation, and planning models for several domains used in International Planning Competition (IPC) 2014. Picat's planner is implemented by use of tabling. During search, every state encountered is tabled, and tabled states are used to effectively perform resource-bounded search. In Picat, structured data can be used to avoid enumerating all possible permutations of objects, and term sharing is used to avoid duplication of common state data. This paper presents several modeling techniques through the example models, ranging from designing state representations to facilitate data sharing and symmetry breaking, encoding actions with operations for efficient precondition checking and state updating, to incorporating domain knowledge and heuristics. Broadly, this paper demonstrates the effectiveness of tabled logic programming for planning, and argues the importance of modeling despite recent significant progress in domain-independent PDDL planners.

Recommendations

• A temporal logic programming approach to planning
• Planning with effectively propositional logic
• Automated Deduction – CADE-20
• Planning with preferences using logic programming
• Logic Programming and Nonmonotonic Reasoning
• Using tabled logic programming to solve the Petrobras planning problem
• scientific article; zbMATH DE number 1696815
• Logic programming in tabular allegories
• Relating logic programming theories of actions and partial order planning

Cites work

• scientific article; zbMATH DE number 3982556 (Why is no real title available?)
• scientific article; zbMATH DE number 3664336 (Why is no real title available?)
• A logic programming approach to knowledge-state planning, semantics and complexity
• Answer set programming and plan generation
• Depth-first iterative-deepening: An optimal admissible tree search
• Efficient tabling of structured data with enhanced hash-consing
• GOLOG: A logic programming language for dynamic domains
• Knowing, reasoning, and acting. Essays in honour of Hector J. Levesque
• Linear tabling strategies and optimizations
• Perspectives on logic-based approaches for reasoning about actions and change
• Tools and Algorithms for the Construction and Analysis of Systems
• Using tabled logic programming to solve the Petrobras planning problem
• Using temporal logics to express search control knowledge for planning

Cited in

(4)

• Using tabled logic programming to solve the Petrobras planning problem
• A temporal logic programming approach to planning
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• Logic Programming and Nonmonotonic Reasoning

Describes a project that uses

Uses Software

• GOLOG

This page was built for publication: Planning as tabled logic programming

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