IP Library › Granted Patent US 12,651,121
Granted Patent B2
US 12,651,121 · App. 18/495,641 · Granted Jun 9, 2026

Large language model-based method for translating a prompt into a planning problem

Inventors: Esmé Manandise (Tallahassee, FL); Anu Sreepathy (Sunnyvale, CA); Sudhir Agarwal (Palo Alto, CA)
Assignee: Intuit Inc.
G06F40/284G06F40/211G06F40/226
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,651,121
App. No.
18/495,641
Filed
Oct 26, 2023
Granted
Jun 9, 2026
Kind
B2
Art Unit
2657
USPC
704/9
Abstract

Certain aspects of the disclosure provide techniques for translating a prompt into a structured input to resolve the natural langue query as a planning problem. A method generally includes identifying and classifying tokens in a prompt using a large language model (LLM); extracting from a domain description in a planning domain definition language (PDDL): object types used to categorize objects; and predicates identifying relationships between the objects that may be true or false; categorizing at least one token in the prompt as one or more of the objects, one or more of the object types, or one or more of the predicates based on the classification of the at least one token determined by the LLM; and generating a task description in the PDDL based on the categorization, the task description comprising a translation of the prompt into a structured input for a planner.

Claims (58)

1 . A method of prompt translation, comprising:

identifying and classifying a plurality of tokens in a prompt using a large language model (LLM), the prompt requesting a state change from an initial state to a desired goal state;

extracting from a domain description in a planning domain definition language (PDDL):

object types used to categorize objects; and

predicates identifying relationships between the objects that may be true or false;

categorizing at least one token of the plurality of tokens in the prompt as one or more of the objects, one or more of the object types, or one or more of the predicates based on a classification of the at least one token determined by the LLM;

generating a task description in the PDDL based on categorization of the at least one token of the plurality of tokens, the task description comprising a translation of the prompt into a structured input for a planner;

determining one or more validation errors exist in the task description in the PDDL;

determining whether a termination condition has been met;

when the termination condition has been met, generating an error message; and

when the termination condition has not been met, generating a new task description in the PDDL to fix the one or more validation errors.

2 . The method of claim 1 , wherein determining whether the termination condition has been met comprises determining the termination condition has been met based on a number of task description generation attempts exceeding a task description generation threshold number.

3 . The method of claim 1 , wherein determining whether the one or more validation errors exist in the task description in the PDDL comprises performing at least one of:

syntactic validation to check whether the task description conforms to a general task description template syntactically;

generic constraint validation to check whether the task description includes elements declared in the domain description in the PDDL; or

domain constraint validation to check whether the task description is consistent with constraints defined in the domain description in the PDDL.

4 . The method of claim 3 , wherein:

determining whether the one or more validation errors exist in the task description in the PDDL comprises performing the syntactic validation, without performing the generic constraint validation and the domain constraint validation, and

the one or more validation errors are determined when performing the syntactic validation.

5 . The method of claim 3 , wherein:

determining whether the one or more validation errors exist in the task description in the PDDL comprises performing the syntactic validation and the generic constraint validation, without performing the domain constraint validation,

the one or more validation errors are determined when performing the generic constraint validation, and

the generic constraint validation is performed after performing the syntactic validation.

6 . The method of claim 1 , wherein the desired goal state requested by the prompt comprises:

a possession of information;

a completion of one or more tasks excluding information retrieval; or

a completion of one or more tasks including the information retrieval.

7 . The method of claim 1 , wherein identifying and classifying the plurality of tokens in the prompt using the LLM comprises prompting, via a set of prompts, the LLM to perform a series of natural language processing (NLP) tasks.

8 . A processing system, comprising:

one or more memories comprising processor-executable instructions; and

one or more processors configured to execute the processor-executable instructions and cause the processing system to:

identify and classify a plurality of tokens in a prompt using a large language model (LLM), the prompt requesting a state change from an initial state to a desired goal state;

extract from a domain description in a planning domain definition language (PDDL):

object types used to categorize objects; and

predicates identifying relationships between the objects that may be true or false;

categorize at least one token of the plurality of tokens in the prompt as one or more of the objects, one or more of the object types, or one or more of the predicates based on a classification of the at least one token determined by the LLM;

generate a task description in the PDDL based on categorization of the at least one token of the plurality of tokens, the task description comprising a translation of the prompt into a structured input for a planner;

determine one or more validation errors exist in the task description in the PDDL;

determine whether a termination condition has been met;

when the termination condition has been met generate an error message; and

when the termination condition has not been met, generate a new task description in the PDDL to fix the one or more validation errors.

9 . The processing system of claim 8 , wherein to determine whether the termination condition has been met, the one or more processors are configured to execute the processor-executable instructions and cause the processing system to determine the termination condition has been met based on a number of task description generation attempts exceeding a task description generation threshold number.

10 . The processing system of claim 8 , wherein to determine whether the one or more validation errors exist in the task description in the PDDL, the one or more processors are configured to execute the processor-executable instructions and cause the processing system to perform at least one of:

syntactic validation to check whether the task description conforms to a general task description template syntactically;

generic constraint validation to check whether the task description includes elements declared in the domain description in the PDDL; or

domain constraint validation to check whether the task description is consistent with constraints defined in the domain description in the PDDL.

11 . The processing system of claim 10 , wherein:

to determine whether the one or more validation errors exist in the task description in the PDDL, the one or more processors are configured to execute the processor-executable instructions and cause the processing system to perform the syntactic validation, without performing the generic constraint validation and the domain constraint validation, and

the one or more validation errors are determined when performing the syntactic validation.

12 . The processing system of claim 10 , wherein:

to determine whether the one or more validation errors exist in the task description in the PDDL, the one or more processors are configured to execute the processor-executable instructions and cause the processing system to perform the syntactic validation and the generic constraint validation, without performing the domain constraint validation,

the one or more validation errors are determined when performing the generic constraint validation, and

the generic constraint validation is performed after performing the syntactic validation.

13 . The processing system of claim 8 , wherein the desired goal state requested by the prompt comprises:

a possession of information;

a completion of one or more tasks excluding information retrieval; or

a completion of one or more tasks including the information retrieval.

14 . The processing system of claim 8 , wherein to identify and classify the plurality of tokens in the prompt using the LLM, the one or more processors are configured to execute the processor-executable instructions and cause the processing system to prompt, via a set of prompts, the LLM to perform a series of natural language processing (NLP) tasks.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 30, 2023
From: MANANDISE, ESMÉ; SREEPATHY, ANU; AGARWAL, SUDHIR
To: INTUIT, INC.
Reel/Frame 065390/0601 →
Continuity (1)
Related Publication 20250139367A1 · May 1, 2025
References Cited (6)
US 20160364377A1 · Krishnamurthy · 2016 [cited by examiner]
US 20240095077A1 · Singh · 2024 [cited by examiner]
US 20250005318A1 · Dvorak · 2025 [cited by examiner]
Xie, Yaqi, et al. Translating Natural Language to Planning Goals with Large-Language Models. arxiv.org/pdf/2302.05128.pdf. [cited by applicant]
Liu, Bo, et al. LLM+P: Empowering Large Language Models with Optimal Planning Proficiency. arxiv.org/pdf/2304.11477.pdf. [cited by applicant]
Silver, Tom, et al. Generalized Planning in PDDL Domains with Pretrained Large Language Models. arxiv.org/pdf/2305.11014.pdf. [cited by applicant]