Automated planning is concerned with finding a sequence of actions that achieve a given goal. Of several formalisms for expressing planning problems, linear logic is promising because it is a logic for reasoning about changes in state. Past research has how fragments of linear logic can be used to encode different kinds of planning problems. However, these works make assumptions about the formal correspondence between linear logic and the STRIPS planning standard that hinder their generality. We provide a method for translating a planning problem into a linear logic judgment that overcomes these issues, and show that our translation is complete with respect to the definition of well-formed problems in first-order STRIPS planning.