Planning as tabled logic programming
From MaRDI portal
Publication:4592996
DOI10.1017/S1471068415000216zbMATH Open1379.68287arXiv1507.03979OpenAlexW3098453185MaRDI QIDQ4592996FDOQ4592996
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)
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.
Full work available at URL: https://arxiv.org/abs/1507.03979
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cites Work
- GOLOG: A logic programming language for dynamic domains
- Title not available (Why is that?)
- Answer set programming and plan generation
- Depth-first iterative-deepening: An optimal admissible tree search
- Using temporal logics to express search control knowledge for planning
- A logic programming approach to knowledge-state planning
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Linear tabling strategies and optimizations
- Perspectives on logic-based approaches for reasoning about actions and change
- Knowing, reasoning, and acting. Essays in honour of Hector J. Levesque
- Using Tabled Logic Programming to Solve the Petrobras Planning Problem
- Efficient tabling of structured data with enhanced hash-consing
Cited In (3)
Uses Software
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)
