Defense Technical Information Center (DTIC) · 1975 · 482 citations · 5 references
ComputingDecision SciencesAlgorithmsKnowledge RepresentationOptimizationSequencingTemporal OrderingGoal-directed PlanningInformation Structure DesignNonlinear Problem SolvingPartial OrderingPartial-order PlanningPlan Formulation
Plans are typically viewed as linear sequences of actions executed one step at a time, yet they are not inherently constrained to linearity. This paper aims to introduce the procedural net, an information structure that represents a plan as a partial ordering of actions relative to time. The procedural net allows a problem‑solving system to postpone commitments to specific action orders, thereby enabling flexible planning. Using this representation, the system can directly and easily solve problems that would otherwise be very difficult.
We usually think of plans as linear sequences of actions. This is because plans are usually executed one step at a time. But plans themselves are not constrained by limitations of linearity. This paper describes a new information structure, called the procedural net, that represents a plan as a partial ordering of actions with respec to time. By avoiding premature commitments to a particular order for achieving subgoals, a problem-solving system using this representation can deal easily and directly with problems that are otherwise very difficult to solve.
5
Planning in a hierarchy of abstraction spaces
Earl D. Sacerdoti · Artificial Intelligence · 1974 · 1.2K citations
Engineering, Systems Engineering, Knowledge Representation +10
Knowledge and reasoning in program synthesis
Zohar Manna, Richard Waldinger · Artificial Intelligence · 1975 · 103 citations