cs.AIMar 19, 2026

When both Grounding and not Grounding are Bad -- A Partially Grounded Encoding of Planning into SAT (Extended Version)

Authors: João Filipe, Gregor Behnke

Organizations: University of Amsterdam, Institute for Logic Language and Computation, The Netherlands

Abstract

Classical planning problems are typically defined using lifted first-order representations, which offer compactness and generality. While most planners ground these representations to simplify reasoning, this can cause an exponential blowup in size. Recent approaches instead operate directly on the lifted level to avoid full grounding. We explore a middle ground between fully lifted and fully grounded planning by introducing three SAT encodings that keep actions lifted while partially grounding predicates. Unlike previous SAT encodings, which scale quadratically with plan length, our approach scales linearly, enabling better performance on longer plans. Empirically, our best encoding outperforms the state of the art in length-optimal planning on hard-to-ground domains.

Figures & tables

Explore similar work

CardsList
  1. Semantic Partial Grounding via LLMs

    Feb 25, 2026Giuseppe Canonaco, Alberto Pozanco, Daniel BorrajoSymbolic Planning

  2. Transforming and Encoding FTS for SAT Solving: What Helps, What Hurts (Extended Version)

    May 28, 2026João Filipe, Álvaro Torralba, Gregor BehnkeSymbolic Planning

  3. LeanPlan: Optimal Planning with LLM-Generated Heuristics and Admissibility Proofs

    Oct 6, 2026André G. Pereira, Augusto B. Corrêa, Felipe Meneguzzi +1Automated Heuristic DesignLLM Planning