{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T04:15:44Z","timestamp":1760328944047,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031556296"},{"type":"electronic","value":"9783031556302"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-55630-2_6","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:51:26Z","timestamp":1710831086000},"page":"69-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Hierarchical Problem Networks for\u00a0Knowledge-Based Planning"],"prefix":"10.1007","author":[{"given":"Pat","family":"Langley","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"key":"6_CR1","unstructured":"Cropper, A., Muggleton, S.H.: Learning efficient logical robot strategies involving composable objects. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, Buenos Aires, Argentina, pp. 3423\u20133429. AAAI Press (2015)"},{"key":"6_CR2","unstructured":"Fine-Morris, M., et al.: Learning hierarchical task networks with landmarks and numeric fluents by combining symbolic and numeric regression. In: Proceedings of the Eighth Annual Conference on Advances in Cognitive Systems. Cognitive Systems Foundation (2020)"},{"key":"6_CR3","unstructured":"Hogg, C., Mu\u00f1oz-Avila, H., Aha, D.W.: HTN-Maker: learning HTNs with minimal additional knowledge engineering required. In: Proceedings of the Twenty-Third National Conference on Artificial Intelligence. AAAI Press (2008)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF00116836","volume":"3","author":"GA Iba","year":"1989","unstructured":"Iba, G.A.: A heuristic approach to the discovery of macro-operators. Mach. Learn. 3, 285\u2013317 (1989)","journal-title":"Mach. Learn."},{"key":"6_CR5","unstructured":"Ilghami, O., Nau, D.S., Mu\u00f1oz-Avila, H., Aha, D.W.: CaMeL: learning method preconditions for HTN planning. In: Proceedings of the Sixth International Conference on AI Planning and Scheduling, Toulouse, France, pp. 131\u2013141. AAAI Press (2002)"},{"key":"6_CR6","first-page":"493","volume":"7","author":"P Langley","year":"2006","unstructured":"Langley, P., Choi, D.: Learning recursive control programs from problem solving. J. Mach. Learn. Res. 7, 493\u2013518 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR7","unstructured":"Langley, P., Shrobe, H.E.: Hierarchical problem networks for knowledge-based planning. In: Proceedings of the Ninth Annual Conference on Advances in Cognitive Systems. Cognitive Systems Foundation (2021)"},{"issue":"November","key":"6_CR8","first-page":"55","volume":"38","author":"P Langley","year":"1995","unstructured":"Langley, P., Simon, H.A.: Applications of machine learning and rule induction. Commun. ACM 38(November), 55\u201364 (1995)","journal-title":"Commun. ACM"},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of logic programming","author":"JW Lloyd","year":"1984","unstructured":"Lloyd, J.W.: Foundations of logic programming. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/978-3-642-96826-6"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Marsella, S.C., Schmidt, C.F.: A method for biasing the learning of nonterminal reduction rules. In: Minton, S. (ed.), Machine learning methods for planning. Morgan Kaufmann: San Francisco, CA (1993)","DOI":"10.1016\/B978-1-4832-0774-2.50020-2"},{"key":"6_CR11","unstructured":"Minton, S.: Quantitative results concerning the utility of explanation-based learning. In: Proceedings of the Seventh National Conference on Artificial Intelligence, St. Paul, MN, pp. 564\u2013569. Morgan Kaufmann (1988)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1613\/jair.1141","volume":"20","author":"D Nau","year":"2003","unstructured":"Nau, D., et al.: SHOP2: An HTN planning system. J. Artif. Intell. Res. 20, 379\u2013404 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Nejati, N., Langley, P., K\u00f6nik, T.: Learning hierarchical task networks by observation. In: Proceedings of the Twenty-Third International Conference on Machine Learning, Pittsburgh, PA, pp. 665\u2013672 (2006)","DOI":"10.1145\/1143844.1143928"},{"key":"6_CR14","unstructured":"Reddy, C., Tadepalli, P.: Learning goal-decomposition rules using exercises. In: Proceedings of the Fourteenth International Conference on Machine Learning, Nashville, TN, pp. 278\u2013286. Morgan Kaufmann (1997)"},{"key":"6_CR15","unstructured":"Ruby, D., Kibler, D.: SteppingStone: An empirical and analytical evaluation. In: Proceedings of the Tenth National Conference on Artificial Intelligence, Menlo Park, CA, pp. 527\u2013532. AAAI Press (1991)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.cogsys.2010.12.002","volume":"12","author":"U Schmid","year":"2011","unstructured":"Schmid, U., Kitzelmann, E.: Inductive rule learning on the knowledge level. Cogn. Syst. Res. 12, 237\u2013248 (2011)","journal-title":"Cogn. Syst. Res."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00115894","volume":"5","author":"J Shavlik","year":"1990","unstructured":"Shavlik, J.: Acquiring recursive and iterative concepts with explanation-based learning. Mach. Learn. 5, 39\u201370 (1990)","journal-title":"Mach. Learn."},{"key":"6_CR18","unstructured":"Shivashankar, V., Kuter, U., Nau, D., Alford, R.: A hierarchical goal-based formalism and algorithm for single-agent planning. In: Proceedings of the Eleventh International Conference on Autonomous Agents and Multiagent Systems, Valencia, Spain, pp. 981\u2013988 (2012)"},{"key":"6_CR19","first-page":"48","volume":"3","author":"D Sleeman","year":"1982","unstructured":"Sleeman, D., Langley, P., Mitchell, T.: Learning from solution paths: An approach to the credit assignment problem. AI Mag. 3, 48\u201352 (1982)","journal-title":"AI Mag."}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55630-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:52:22Z","timestamp":1710831142000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55630-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556296","9783031556302"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55630-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Windsor Great Park","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijclr22.doc.ic.ac.uk\/ilp2022.html\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}