STRIPS: Stanford Research Institute Problem Solver—a formal language for describing automated planning problems using initial states, goals, and actions with preconditions/effects
PDDL: Planning Domain Definition Language—a standard encoding format for automated planning problems
Graph Coloring: An NP-complete problem where the goal is to assign colors to graph vertices such that no two connected vertices share the same color
Game of 24: A math puzzle where 4 numbers must be combined using arithmetic operations to equal 24
Sound Verifier: An external, non-LLM program (e.g., Python script, VAL) that is guaranteed to correctly validate if a solution is true or false
LLM-Modulo: A framework where LLMs are used for generation but are checked and guided by external symbolic verifiers/solvers
False Negative Rate: The rate at which the verifier (LLM) incorrectly rejects a valid solution
Backprompting: The process of feeding the LLM's previous output (and potentially critique) back into it to request a correction