{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:08:42Z","timestamp":1746288522068,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030148041"},{"type":"electronic","value":"9783030148058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-14805-8_10","type":"book-chapter","created":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T13:04:29Z","timestamp":1550667869000},"page":"172-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Building a Generic Feedback System for Rule-Based Problems"],"prefix":"10.1007","author":[{"given":"Nico","family":"Naus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Jeuring","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,21]]},"reference":[{"issue":"1\u20132","key":"10_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional STRIPS planning. Artif. Intell. 69(1\u20132), 165\u2013204 (1994)","journal-title":"Artif. Intell."},{"issue":"3\u20134","key":"10_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R Fikes","year":"1971","unstructured":"Fikes, R., 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":"2","key":"10_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01069337","volume":"15","author":"NI Galagan","year":"1979","unstructured":"Galagan, N.I.: Problem description language SITPLAN. Cybern. Syst. Anal. 15(2), 255\u2013266 (1979)","journal-title":"Cybern. Syst. Anal."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Gerdes, A., Jeuring, J., Heeren, B.: An interactive functional programming tutor. In: Lapidot, T., Gal-Ezer, J., Caspersen, M.E., Hazzan, O. (eds) Proceedings of ITICSE 2012: The 17th Annual Conference on Innovation and Technology in Computer Science Education, pp. 250\u2013255. ACM (2012)","DOI":"10.1145\/2325296.2325356"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.3102\/003465430298487","volume":"77","author":"J Hattie","year":"2007","unstructured":"Hattie, J., Timperley, H.: The power of feedback. Rev. Educ. Res. 77(1), 81\u2013112 (2007)","journal-title":"Rev. Educ. Res."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.scico.2014.02.021","volume":"88","author":"B Heeren","year":"2014","unstructured":"Heeren, B., Jeuring, J.: Feedback services for stepwise exercises. Sci. Comput. Program. 88, 110\u2013129 (2014)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s11786-010-0027-4","volume":"3","author":"B Heeren","year":"2010","unstructured":"Heeren, B., Jeuring, J., Gerdes, A.: Specifying rewrite strategies for interactive exercises. Math. Comput. Sci. 3(3), 349\u2013370 (2010)","journal-title":"Math. Comput. Sci."},{"key":"10_CR8","unstructured":"Hewitt, C.: PLANNER: a language for proving theorems in robots. In: Proceedings of the 1st International Joint Conference on Artificial Intelligence, Washington, DC, May 1969, pp. 295\u2013302 (1969)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-319-24258-3_49","volume-title":"Design for Teaching and Learning in a Networked World","author":"J Jeuring","year":"2015","unstructured":"Jeuring, J., et al.: Communicate!\u2014A serious game for communication skills. In: Conole, G., Klobu\u010dar, T., Rensing, C., Konert, J., Lavou\u00e9, \u00c9. (eds.) EC-TEL 2015. LNCS, vol. 9307, pp. 513\u2013517. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24258-3_49"},{"key":"10_CR10","unstructured":"Junghanns, A., Schaeffer, J., Sokoban: a challenging single-agent search problem. In: IJCAI Workshop on Using Games as an Experimental Testbed for AI Reasearch (1997)"},{"key":"10_CR11","unstructured":"Kovacs, D.L.: BNF definition of PDDL 3.1 (2011). http:\/\/www.plg.inf.uc3m.es\/ipc2011-deterministic\/attachments\/OtherContributions\/kovacs-pddl-3.1-2011.pdf"},{"key":"10_CR12","unstructured":"Kovacs, D.L.: A multi-agent extension of PDDL3. In: WS-IPC 2012, p. 19 (2012)"},{"key":"10_CR13","unstructured":"Lavelle, S.: PuzzleScript (2016). https:\/\/github.com\/increpare\/PuzzleScript"},{"key":"10_CR14","unstructured":"Lim, C.-U., Fox Harrell, D.: An approach to general videogame evaluation and automatic generation using a description language. In: Proceedings of IEEE CIG 2014: Conference on Computational Intelligence and Games, pp. 1\u20138 (2014)"},{"key":"10_CR15","volume-title":"Artificial Intelligence: Structures and Strategies for Complex Problem Solving","author":"GF Luger","year":"2005","unstructured":"Luger, G.F.: Artificial Intelligence: Structures and Strategies for Complex Problem Solving. Pearson Education, London (2005)"},{"key":"10_CR16","unstructured":"McDermott, D., et al.: PDDL-The Planning Domain Definition Language (1998)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-94-017-0819-7_17","volume-title":"Authoring Tools for Advanced Technology Learning Environments","author":"T Murray","year":"2003","unstructured":"Murray, T.: An overview of intelligent tutoring system authoring tools: updated analysis of the state of the art. In: Murray, T., Blessing, S.B., Ainsworth, S. (eds.) Authoring Tools for Advanced Technology Learning Environments, pp. 491\u2013544. Springer, Dordrecht (2003). https:\/\/doi.org\/10.1007\/978-94-017-0819-7_17"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Plasmeijer, R., Lijnse, B., Michels, S., Achten, P., Koopman, P.W.M.: Task-oriented programming in a pure functional language. In: Proceedings of PPDP 2012: Principles and Practice of Declarative Programming, pp. 195\u2013206. ACM (2012)","DOI":"10.1145\/2370776.2370801"},{"key":"10_CR19","unstructured":"Plasmeijer, R., van Eekelen, M.: Clean language report version 2.1 (2002)"},{"key":"10_CR20","unstructured":"Reinefeld, A.: Complete solution of the eight-puzzle and the benefit of node ordering in IDA. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence, Chamb\u00e9ry, France, 28 August\u20133 September 1993, pp. 248\u2013253 (1993)"},{"key":"10_CR21","volume-title":"Artificial Intelligence - A Modern Approach (3 International Edition)","author":"SJ Russell","year":"2010","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence - A Modern Approach (3 International Edition). Pearson Education, London (2010)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Stutterheim, J., Achten, P., Plasmeijer, R.: Static and dynamic visualisations of monadic programs. In: Implementation and Application of Functional Languages, Koblenz, Germany, pp. 1\u201313, December 2015","DOI":"10.1145\/2897336.2897337"},{"key":"10_CR23","unstructured":"Stutterheim, J., Achten, P., Plasmeijer, R.: C2 demo (2016). https:\/\/gitlab.science.ru.nl\/clean-and-itasks\/iTasks-SDK\/tree\/master\/Examples\/Applications\/c2-demo"},{"issue":"3","key":"10_CR24","first-page":"227","volume":"16","author":"K VanLehn","year":"2006","unstructured":"VanLehn, K.: The behavior of tutoring systems. Int. J. Artif. Intell. Educ. 16(3), 227\u2013265 (2006)","journal-title":"Int. J. Artif. Intell. Educ."},{"issue":"3","key":"10_CR25","first-page":"147","volume":"15","author":"K VanLehn","year":"2005","unstructured":"VanLehn, K., et al.: The Andes physics tutoring system: lessons learned. Int. J. Artif. Intell. Educ. 15(3), 147\u2013204 (2005)","journal-title":"Int. J. Artif. Intell. Educ."},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Visser, E., Benaissa, Z.-E.-A., Tolmach, A.P.: Building program optimizers with rewriting strategies. In: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming (ICFP 1998), Baltimore, Maryland, USA, 27\u201329 September 1998, pp. 13\u201326 (1998)","DOI":"10.1145\/289423.289425"},{"key":"10_CR27","unstructured":"Younes, H.L.S., Littman, M.L.: PPDDL1. 0: the language for the probabilistic part of IPC-4. In: Proceedings of the International Planning Competition (2004)"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14805-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T04:53:32Z","timestamp":1662958412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-14805-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148041","9783030148058"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14805-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"College Park, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"18","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"56% - 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"}},{"value":"3,7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,35","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}