Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 1992

UCPOP: a sound, complete, partial order planner for ADL

J. Scott Penberthy, Daniel S. Weld

Cited by 669Abstract and details only

Abstract

We describe the UCPOP partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, UCPOP operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove UCPOP is both sound and complete for this representation and describe a practical implementation that succeeds on all of Pednault's and McDermott's examples, including the infamous "Yale Stacking Problem" [McDermott 1991].

Cite this paper

APA 7

Penberthy, J. S., & Weld, D. S. (1992). UCPOP: a sound, complete, partial order planner for ADL.

MLA 9

Penberthy, J. Scott, and Daniel S. Weld. “UCPOP: a sound, complete, partial order planner for ADL.” 1992, pp. 103–14.

Chicago

Penberthy, J. Scott, and Daniel S. Weld. 1992. “UCPOP: a sound, complete, partial order planner for ADL.”

Harvard

Penberthy, J.S. and Weld, D.S. (1992) ‘UCPOP: a sound, complete, partial order planner for ADL’.

BibTeX
@article{penberthy1992ucpop,
  title = {{UCPOP: a sound, complete, partial order planner for ADL}},
  author = {Penberthy, J. Scott and Weld, Daniel S.},
  pages = {103--114},
  year = {1992}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers