Pith. sign in

REVIEW 1 cited by

Deep Learning for Generalised Planning with Background Knowledge

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.07923 v1 pith:VFIJ5Y4W submitted 2024-10-10 cs.AI

classification cs.AI
keywords planninglearningknowledgeproblemssolveapproachbackgroundeasy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Automated planning is a form of declarative problem solving which has recently drawn attention from the machine learning (ML) community. ML has been applied to planning either as a way to test `reasoning capabilities' of architectures, or more pragmatically in an attempt to scale up solvers with learned domain knowledge. In practice, planning problems are easy to solve but hard to optimise. However, ML approaches still struggle to solve many problems that are often easy for both humans and classical planners. In this paper, we thus propose a new ML approach that allows users to specify background knowledge (BK) through Datalog rules to guide both the learning and planning processes in an integrated fashion. By incorporating BK, our approach bypasses the need to relearn how to solve problems from scratch and instead focuses the learning on plan quality optimisation. Experiments with BK demonstrate that our method successfully scales and learns to plan efficiently with high quality solutions from small training data generated in under 5 seconds.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Graph Learning for Planning: The Story Thus Far and Open Challenges

    cs.AI 2024-12 conditional novelty 3.0 of 10

    Linear graph-kernel models beat GNNs for learned planning heuristics, and ranking objectives beat cost-to-go regression.

Pith tools