{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:16:36Z","timestamp":1743084996097,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319671895"},{"type":"electronic","value":"9783319671901"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67190-1_22","type":"book-chapter","created":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T05:48:49Z","timestamp":1505713729000},"page":"286-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Action Model Acquisition Using Sequential Pattern Mining"],"prefix":"10.1007","author":[{"given":"Ankuj","family":"Arora","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Humbert","family":"Fiorino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Pellier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvie","family":"Pesty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,19]]},"reference":[{"key":"22_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB, vol. 1215, pp. 487\u2013499 (1994)"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009725216438","volume":"2","author":"B Borchers","year":"1998","unstructured":"Borchers, B., Furman, J.: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. J. Comb. Optim. 2(4), 299\u2013306 (1998)","journal-title":"J. Comb. Optim."},{"issue":"3\u20134","key":"22_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"RE Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3\u20134), 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"issue":"1","key":"22_CR4","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomariz, A., Gueniche, T., Soltani, A., Wu, C.W., Tseng, V.S.: SPMF: a Java open-source pattern mining library. J. Mach. Learn. Res. 15(1), 3389\u20133393 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-30353-1_27","volume-title":"Advances in Artificial Intelligence","author":"P Fournier-Viger","year":"2012","unstructured":"Fournier-Viger, P., Wu, C.-W., Tseng, V.S., Nkambou, R.: Mining sequential rules common to several sequences with the window size constraint. In: Kosseim, L., Inkpen, D. (eds.) AI 2012. LNCS, vol. 7310, pp. 299\u2013304. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-30353-1_27"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1008134010576","volume":"29","author":"R Garc\u00eda-Mart\u00ednez","year":"2000","unstructured":"Garc\u00eda-Mart\u00ednez, R., Borrajo, D.: An integrated approach of learning, planning, and execution. J. Intell. Rob. Syst. 29(1), 47\u201378 (2000)","journal-title":"J. Intell. Rob. Syst."},{"key":"22_CR7","unstructured":"Jim\u00e9nez, S., Fern\u00e1ndez, F., Borrajo, D.: The PELA architecture: integrating planning and learning to improve execution. In: AAAI (2008)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1090\/dimacs\/035\/15","volume":"35","author":"HA Kautz","year":"1996","unstructured":"Kautz, H.A., Selman, B., Jiang, Y.: A general stochastic approach to solving problems with hard and soft constraints. Satisfiability Probl. Theor. Appl. 35, 573\u2013586 (1996)","journal-title":"Satisfiability Probl. Theor. Appl."},{"key":"22_CR9","unstructured":"McDermott, D., Ghallab, M., Howe, A., Knoblock, C., Ram, A., Veloso, M., Weld, D., Wilkins, D.: PDDL-the planning domain definition language (1998)"},{"issue":"2\u20133","key":"22_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.artint.2006.11.005","volume":"171","author":"Q Yang","year":"2007","unstructured":"Yang, Q., Wu, K., Jiang, Y.: Learning action models from plan examples using weighted MAX-SAT. Artif. Intell. 171(2\u20133), 107\u2013143 (2007)","journal-title":"Artif. Intell."},{"key":"22_CR11","unstructured":"Yoon, S., Kambhampati, S.: Towards model-lite planning: A proposal for learning & planning with incomplete domain models. In: ICAPS Workshop on Artificial Intelligence Planning and Learning (2007)"},{"key":"22_CR12","unstructured":"Zhuo, H.H., Nguyen, T.A., Kambhampati, S.: Refining incomplete planning domain models through plan traces. In: IJCAI, pp. 2451\u20132458, August 2013"}],"container-title":["Lecture Notes in Computer Science","KI 2017: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67190-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:34:56Z","timestamp":1558319696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67190-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319671895","9783319671901"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67190-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ki2017.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}