When both Grounding and not Grounding are Bad -- A Partially Grounded Encoding of Planning into SAT (Extended Version)
#planning #SAT #grounding #encoding #artificial intelligence #computational logic #extended version
📌 Key Takeaways
- The paper introduces a partially grounded encoding method for planning problems into SAT.
- It addresses limitations of both fully grounded and non-grounded approaches in planning.
- The extended version includes additional details, experiments, or proofs beyond the original.
- The method aims to improve efficiency and scalability in SAT-based planning systems.
📖 Full Retelling
arXiv:2603.19429v1 Announce Type: new
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 th
🏷️ Themes
Planning, SAT Encoding
Entity Intersection Graph
No entity connections available yet for this article.
Original Source
arXiv:2603.19429v1 Announce Type: new
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 th
Read full article at source