Plan-Then-Verify: Verifier-First Planning for Early Feasibility Validation in LLM Agent Systems

Pre-execution feasibility validation can substantially improve LLM-based task planning without proportional inference cost, but only when it is grounded, deterministic, and tightly bounded. We propose Plan-Then-Verify (PTV), a verifier-first control pattern in which a candidate workflow is checked against a documented knowledge base before execution begins. A planner generates a structured task graph, a deterministic verifier validates functions, artifacts, and ordering constraints, and one bounded repair pass applies local edits when possible. Unsupported workflows are blocked through safe abstention rather than hallucinated capability invention. We evaluate PTV on Core-60, a 60-task public benchmark spanning supported, multi-step, repair-sensitive, and unsupported requests. Across local and server-side model panels, PTV substantially improves the reported static conformance score on several model families, including Gemma, Devstral, and DeepSeek, while remaining close to Plan-and-Execute in token cost. This score combines supported-task success with correct abstention on unsupported requests; it is not a real-execution success rate. Paired bootstrap confidence intervals show positive PTV–PAE conformance differences for the positive model families and near-zero effects for model-serving configurations whose structured outputs collapse. Additional schema-constrained reruns show that this boundary condition is not merely a scoring artifact: Qwen and DeepSeek recover usable structured plans and then show clear PTV gains, whereas GPT-OSS and GLM remain fragile under the tested serving stack. The primary benchmark is static and invokes no real tools; an auxiliary sandbox replay executes stored plans against mock tools derived from the same specification. The primary outcomes measure conformance to the frozen knowledge base and feasibility criteria, while the replay provides side-effect-free trace checks. These results suggest that lightweight feasibility validation improves static SOP conformance primarily by amplifying planners capable of producing stable structured workflows, rather than compensating for weak upstream plan representations. Core-60, the knowledge-base specification, implementation, and analysis materials are publicly available.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-11-01
DOI
https://doi.org/10.3390/app162110828
Primary Topic
AI-based Problem Solving and Planning
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Plan-Then-Verify: Verifier-First Planning for Early Feasibility Validation in LLM Agent Systems

Andrzej Kawiak, Adam Kobus, Emil Benedykciuk, Marcin Denkowski et al.
Applied Sciences
AI-based Problem Solving and Planning
article

Plan-Then-Verify: Verifier-First Planning for Early Feasibility Validation in LLM Agent Systems

Andrzej Kawiak, Adam Kobus, Emil Benedykciuk, Marcin Denkowski, Grzegorz M. Wójcik, Marek Jezior, Stanisław Kurasiewicz
article en

Abstract

Pre-execution feasibility validation can substantially improve LLM-based task planning without proportional inference cost, but only when it is grounded, deterministic, and tightly bounded. We propose Plan-Then-Verify (PTV), a verifier-first control pattern in which a candidate workflow is checked against a documented knowledge base before execution begins. A planner generates a structured task graph, a deterministic verifier validates functions, artifacts, and ordering constraints, and one bounded repair pass applies local edits when possible. Unsupported workflows are blocked through safe abstention rather than hallucinated capability invention. We evaluate PTV on Core-60, a 60-task public benchmark spanning supported, multi-step, repair-sensitive, and unsupported requests. Across local and server-side model panels, PTV substantially improves the reported static conformance score on several model families, including Gemma, Devstral, and DeepSeek, while remaining close to Plan-and-Execute in token cost. This score combines supported-task success with correct abstention on unsupported requests; it is not a real-execution success rate. Paired bootstrap confidence intervals show positive PTV–PAE conformance differences for the positive model families and near-zero effects for model-serving configurations whose structured outputs collapse. Additional schema-constrained reruns show that this boundary condition is not merely a scoring artifact: Qwen and DeepSeek recover usable structured plans and then show clear PTV gains, whereas GPT-OSS and GLM remain fragile under the tested serving stack. The primary benchmark is static and invokes no real tools; an auxiliary sandbox replay executes stored plans against mock tools derived from the same specification. The primary outcomes measure conformance to the frozen knowledge base and feasibility criteria, while the replay provides side-effect-free trace checks. These results suggest that lightweight feasibility validation improves static SOP conformance primarily by amplifying planners capable of producing stable structured workflows, rather than compensating for weak upstream plan representations. Core-60, the knowledge-base specification, implementation, and analysis materials are publicly available.

Applied SciencesVol. 16(21)
Maria Curie-Skłodowska University (PL)
Openalex Percentile: Top 13%
AI-based Problem Solving and Planning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon