The paper presents a method for automatically generating generalized plans in Lean, along with formal proofs of their completeness for given domain constraints. It introduces a semantic‑preserving conversion from PDDL to Lean and uses an LLM to produce both the plan and its proof, whose correctness is verified by Lean’s kernel. Evaluated on 13 benchmark domains with GPT‑5.6‑Sol, the approach yields complete plans and valid proofs for 12 of them, marking a significant advance in automated generalized‑plan completeness.
By Katharina Stein, Chaahat Jain, J\"org Hoffmann, Alexander Koller
arXiv:2403. 19883v2 Announce Type: replace Abstract: Fully-observable non-deterministic (FOND) planning is at the core of artificial intelligence planning with uncertainty.
By Frederico Messa, Andr\'e Grahl Pereira
arXiv:2606. 14574v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly deployed as planners for autonomous agents in household environments.
By Xiaoxin Lu, Ranran Haoran Zhang, Rui Zhang
The paper introduces OHCAM, an online method for learning action models that include conditional and quantified effects from limited interactions. It maintains a belief over possible models and actively chooses actions that maximize disagreement among hypotheses to reduce uncertainty, while handling noisy observations. Starting with simple hypotheses, OHCAM expands complexity only when necessary, achieving sample‑efficient learning that outperforms baselines on benchmark domains and is validated on a Kinova Gen3 robot.
By Jeffrey Jewett, William Solow, Sandhya Saisubramanian
arXiv:2602.00276v3 Announce Type: replace
Abstract: Large language models (LLMs) have demonstrated strong reasoning capabilities on math and coding, but frequently fail on symbolic classical planning...
By Aditya Kumar, William W. Cohen
arXiv:2506. 09171v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) are increasingly capable, but LLM agents still struggle to plan effectively in interactive, partially observable, long-horizon environments when search is unguided or recent history is insufficient.
By Samuel Holt, Max Ruiz Luyten, Thomas Pouplin, Mihaela van der Schaar
arXiv:2509. 16456v3 Announce Type: replace Abstract: Large language models (LLMs) are increasingly used in various domains, showing impressive potential on different tasks.
By Jiahao Yu, Zelei Cheng, Xian Wu, Xinyu Xing
arXiv:2608. 16637v1 Announce Type: new Abstract: LLMs remain unreliable for long-horizon planning, often generating logically inconsistent or non-applicable plans.
By Veit Laule, Jiangtao Shuai, Manfred Hauswirth, Sonja Schimmler
PIE-APT introduces a unified framework for abductive planning over Temporal Dynamic Knowledge Graphs (TDKGs) using two modules: PIE-Abducer, which performs incremental direct-derivation abduction, and PIE-APT, which interleaves backward‑chaining A* search with PIE-Abducer to generate action sequences and abductive assumptions. The approach operates natively on the expressive SROIQ Description Logic, leveraging an incremental reasoner to maintain decidability and bypass the Ramification Problem. Evaluation on four OWL benchmarks demonstrates qualitative superiority over classical planners and shows that the direct‑derivation method outperforms a Minimal Hitting Set baseline in abductive enrichment.
By Amir Hossein Sharafi, Alireza Shahbazi
arXiv:2601. 09097v3 Announce Type: replace Abstract: Multi-constraint planning involves identifying, evaluating, and refining candidate plans while satisfying multiple, potentially conflicting constraints.
By Derrick Goh Xin Deik, Quanyu Long, Zhengyuan Liu, Nancy F. Chen, Wenya Wang
arXiv:2602. 22067v2 Announce Type: replace Abstract: Grounding is a critical step in classical planning, yet it often becomes a computational bottleneck due to the exponential growth in grounded actions and atoms as task size increases.
By Giuseppe Canonaco, Alberto Pozanco, Daniel Borrajo
arXiv:2606. 29700v1 Announce Type: new Abstract: Planning often requires symbolic specifications that are both executable and verifiable.
By Jiamei Jiang, Jiajing Zhang, Feifei Mo, Linjing Li, Daniel Zeng