@inproceedings{erol_umcp:_1994,
	title = {{UMCP}: {A} {Sound} and {Complete} {Procedure} for {Hierarchical} {Task}-network {Planning}},
	shorttitle = {{UMCP}},
	abstract = {One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for htn planning. Based on this syntax and semantics, we are able to define an algorithm for htn planning and prove it sound and complete.},
	booktitle = {{AIPS}},
	author = {Erol, Kutluhan and Hendler, James A. and Nau, Dana S.},
	year = {1994},
	keywords = {Algorithm, Analysis of algorithms, Automated planning and scheduling, ENCODE, Formal grammar, Hierarchical task network, STRIPS, Semantics (computer science)}
}

{"_id":"w5x7zkCZyp7w2YHoj","bibbaseid":"erol-hendler-nau-umcpasoundandcompleteprocedureforhierarchicaltasknetworkplanning-1994","authorIDs":[],"author_short":["Erol, K.","Hendler, J. A.","Nau, D. S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning","shorttitle":"UMCP","abstract":"One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for htn planning. Based on this syntax and semantics, we are able to define an algorithm for htn planning and prove it sound and complete.","booktitle":"AIPS","author":[{"propositions":[],"lastnames":["Erol"],"firstnames":["Kutluhan"],"suffixes":[]},{"propositions":[],"lastnames":["Hendler"],"firstnames":["James","A."],"suffixes":[]},{"propositions":[],"lastnames":["Nau"],"firstnames":["Dana","S."],"suffixes":[]}],"year":"1994","keywords":"Algorithm, Analysis of algorithms, Automated planning and scheduling, ENCODE, Formal grammar, Hierarchical task network, STRIPS, Semantics (computer science)","bibtex":"@inproceedings{erol_umcp:_1994,\n\ttitle = {{UMCP}: {A} {Sound} and {Complete} {Procedure} for {Hierarchical} {Task}-network {Planning}},\n\tshorttitle = {{UMCP}},\n\tabstract = {One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for htn planning. Based on this syntax and semantics, we are able to define an algorithm for htn planning and prove it sound and complete.},\n\tbooktitle = {{AIPS}},\n\tauthor = {Erol, Kutluhan and Hendler, James A. and Nau, Dana S.},\n\tyear = {1994},\n\tkeywords = {Algorithm, Analysis of algorithms, Automated planning and scheduling, ENCODE, Formal grammar, Hierarchical task network, STRIPS, Semantics (computer science)}\n}\n\n","author_short":["Erol, K.","Hendler, J. A.","Nau, D. S."],"key":"erol_umcp:_1994","id":"erol_umcp:_1994","bibbaseid":"erol-hendler-nau-umcpasoundandcompleteprocedureforhierarchicaltasknetworkplanning-1994","role":"author","urls":{},"keyword":["Algorithm","Analysis of algorithms","Automated planning and scheduling","ENCODE","Formal grammar","Hierarchical task network","STRIPS","Semantics (computer science)"],"downloads":0},"bibtype":"inproceedings","biburl":"https://api.zotero.org/users/5371004/collections/BFDRCLUN/items?key=cT744W96pEanbXJOznNwWrlT&format=bibtex&limit=100","creationDate":"2019-12-09T14:42:18.087Z","downloads":0,"keywords":["algorithm","analysis of algorithms","automated planning and scheduling","encode","formal grammar","hierarchical task network","strips","semantics (computer science)"],"search_terms":["umcp","sound","complete","procedure","hierarchical","task","network","planning","erol","hendler","nau"],"title":"UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning","year":1994,"dataSources":["a8Fg2czGYtdfQXT7B"]}