Planning as Theorem Proving with Heuristics

Mikhail Soutchanski, Ryan Young
3/23/2023
cs.AIcs.LO

No confident code implementation found for this paper.

Abstract

Planning as theorem proving in situation calculus was abandoned 50 years ago as an impossible project. But we have developed a Theorem Proving Lifted Heuristic (TPLH) planner that searches for a plan in a tree of situations using the A* search algorithm. It is controlled by a delete relaxation-based domain independent heuristic. We compare TPLH with Fast Downward (FD) and Best First Width Search (BFWS) planners over several standard benchmarks. Since our implementation of the heuristic function is not optimized, TPLH is slower than FD and BFWS. But it computes shorter plans, and it explores fewer states. We discuss previous research on planning within KR\&R and identify related directions. Thus, we show that deductive lifted heuristic planning in situation calculus is actually doable.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objects

86% match2023

SayCanPay: Heuristic Planning with Large Language Models using Learnable Domain Knowledge

84% match2023

Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+

82% match2023

Relevance Score: A Landmark-Like Heuristic for Planning

81% match2024

PRP Rebooted: Advancing the State of the Art in FOND Planning

81% match2023

LLM-Evolved Pattern Generators for Optimal Classical Planning

81% match2026

Cite this paper

@article{soutchanski2023planning,
  title  = {Planning as Theorem Proving with Heuristics},
  author = {Mikhail Soutchanski and Ryan Young},
  year   = {2023},
  eprint = {2303.13638},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.13638v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.13638.svg)](https://codeofpaper.com/paper/2303.13638)

Discussion