Intermediate Results on the Complexity of STRIPS$_{1}^{1}$
Intermediate Results on the Complexity of STRIPS$_{1}^{1}$ explores Explores the computational complexity of propositional STRIPS planning with a focus on small solution hypotheses and literal graphs.. Commercial viability score: 2/10 in AI Planning.
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $9K - $13K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Prior WorkReasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMsViability: 2.0
- Prior WorkCompiling Temporal Numeric Planning into Discrete PDDL+: Extended VersionViability: 2.0
- Higher ViabilitySemantic Partial Grounding via LLMsViability: 5.0
- Higher ViabilityLanguage Model Planners do not Scale, but do Formalizers?Viability: 3.0
- Higher ViabilityPrompt Architecture Determines Reasoning Quality: A Variable Isolation Study on the Car Wash ProblemViability: 4.0