{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T15:59:15Z","timestamp":1765727955789,"version":"3.40.5"},"reference-count":46,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T00:00:00Z","timestamp":1714608000000},"content-version":"unspecified","delay-in-days":1,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Payroll management is a critical business task that is subject to a large number of rules, which vary widely between companies, sectors, and countries. Moreover, the rules are often complex and change regularly. Therefore, payroll management systems must be flexible in design. In this paper, we suggest an approach based on a flexible answer set programming (ASP) model and an easy-to-read tabular representation based on the decision model and notation standard. It allows HR consultants to represent complex rules without the need for a software engineer and to ultimately design payroll systems for a variety of different scenarios. We show how the multi-shot solving capabilities of the <jats:italic>clingo<\/jats:italic> ASP system can be used to reach the performance that is necessary to handle real-world instances.<\/jats:p>","DOI":"10.1017\/s1471068424000115","type":"journal-article","created":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T08:28:36Z","timestamp":1714638516000},"page":"453-481","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Shot Answer Set Programming for Flexible Payroll Management"],"prefix":"10.1017","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3295-7371","authenticated-orcid":false,"given":"BENJAMIN","family":"CALLEWAERT","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0791-0176","authenticated-orcid":false,"given":"JOOST","family":"VENNEKENS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2024,5,2]]},"reference":[{"key":"S1471068424000115_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.02.002"},{"key":"S1471068424000115_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-019-01416-4"},{"key":"S1471068424000115_ref24","unstructured":"Kim, T.-W. , Lee, J. and Palla, R. 2009. Circumscriptive event calculus as answer set programming. In Proceedings of the 21st International Joint Conference on Artificial Intelligence. IJCAI\u201909, Morgan Kaufmann Publishers Inc, San Francisco, CA, USA, 823\u2013829"},{"key":"S1471068424000115_ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068424000115_ref13","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. and Schaub, T. 2014. Clingo= asp + control: Preliminary report. (Technical Communications of the 30th International Conference on Logic Programming"},{"key":"S1471068424000115_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068424000115_ref36","unstructured":"Mueller, E. T. 2004b. A tool for satisfiability-based commonsense reasoning in the event calculus. (Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference (FLAIRS), 4, 17\u201319"},{"key":"S1471068424000115_ref39","unstructured":"Shanahan, M. 1990. Representing continuous change in the event calculus. In European Conference on Artificial Intelligence. Citeseer, 598\u2013603."},{"key":"S1471068424000115_ref29","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3489"},{"key":"S1471068424000115_ref6","doi-asserted-by":"crossref","unstructured":"Calimeri, F. , Ianni, G. , Pacenza, F. , Perri, S. and Zangari, J. 2022. ASP-based multi-shot reasoning via DLV2 with incremental grounding. In Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming, 1\u20139.","DOI":"10.1145\/3551357.3551371"},{"key":"S1471068424000115_ref40","unstructured":"Shanahan, M. 1996. Robotics and the common sense informatic situation. In European Conference on Artificial Intelligence, 684\u2013688."},{"key":"S1471068424000115_ref44","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00077-1"},{"key":"S1471068424000115_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068424000115_ref35","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/14.5.703"},{"key":"S1471068424000115_ref23","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2810"},{"key":"S1471068424000115_ref26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018934223383"},{"key":"S1471068424000115_ref33","first-page":"1","article-title":"Circumscription \u2013 A form of non-monotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"S1471068424000115_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068421000156"},{"key":"S1471068424000115_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003323"},{"key":"S1471068424000115_ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9116-y"},{"key":"S1471068424000115_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"S1471068424000115_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_51"},{"key":"S1471068424000115_ref1","doi-asserted-by":"crossref","unstructured":"Alviano, M. , Amendola, G. , Dodaro, C. , Leone, N. , Maratea, M. and Ricca, F. 2019. Evaluation of disjunctive programs in WASP. In Proceedings. Lecture Notes in Computer Science, Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Springer, Philadelphia, PA, USA, vol. 11481, 241\u2013255, Proceedings. Lecture Notes in Computer Science, June 3-7, 2019.","DOI":"10.1007\/978-3-030-20528-7_18"},{"key":"S1471068424000115_ref42","first-page":"409","volume-title":"The Event Calculus Explained","author":"Shanahan","year":"1999"},{"key":"S1471068424000115_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8531-6_14"},{"key":"S1471068424000115_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000054"},{"key":"S1471068424000115_ref21","unstructured":"Hasi\u0107, M. , Seng, J. C. and Neureiter, G. 2017. Towards a lightweight decision requirements diagram for DMN. International Conference on Advanced Information Systems Engineering, Springer, 210\u2013224."},{"key":"S1471068424000115_ref10","unstructured":"Eshghi, K. 1988. Abductive planning with event calculus. In Logic Programming, Proceedings of the Fifth International Conference and Symposium, 562\u2013579"},{"key":"S1471068424000115_ref43","unstructured":"Shanahan, M. 1999b. The ramification problem in the event calculus. In International Joint Conference on Artificial Intelligence (IJCAI), 99, 140\u2013146."},{"key":"S1471068424000115_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000285"},{"volume-title":"DMN Method and Style: The Practitioner\u2019s Guide to Decision Modeling with Business Rules","year":"2016","author":"Silver","key":"S1471068424000115_ref45"},{"key":"S1471068424000115_ref15","unstructured":"Gelfond, M. and Inclezan, D. 2009. Yet another modular action language. In Proceedings of the Second International Workshop on Software Engineering for Answer Set Programming, 64\u201378."},{"key":"S1471068424000115_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000571"},{"key":"S1471068424000115_ref38","unstructured":"Oikarinen, E. and Janhunen, T. 2006. Modular equivalence for normal logic programs. In Proceedings of the 2006 Conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29, Riva Del Garda, Italy, IOS Press, NLD, 412-416."},{"key":"S1471068424000115_ref37","unstructured":"Object Management Group 2015. Decision model and notation (DMN) 1.0 specification."},{"key":"S1471068424000115_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01561-8"},{"key":"S1471068424000115_ref31","first-page":"75","volume-title":"EPiC Series in Computing","volume":"26","author":"Ma","year":"2014"},{"key":"S1471068424000115_ref16","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.2013.798954"},{"key":"S1471068424000115_ref22","doi-asserted-by":"publisher","DOI":"10.1017\/S147106842000040X"},{"key":"S1471068424000115_ref17","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. Proceedings of International Logic Programming Conference and Symposium (ICLP), 5, 1070\u20131080."},{"key":"S1471068424000115_ref32","first-page":"75","volume-title":"19th International Conference On Logic for Programming, Artificial Intelligence and Reasoning (LPAR)","author":"Ma","year":"2014"},{"volume-title":"Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia","year":"1997","author":"Shanahan","key":"S1471068424000115_ref41"},{"key":"S1471068424000115_ref9","unstructured":"Doody, R. J. et\u00a0al. (1982). Report on the payroll system."},{"key":"S1471068424000115_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037383"},{"key":"S1471068424000115_ref20","first-page":"23","volume-title":"ACM SIGMIS Database: The DATABASE for Advances in Information Systems 47","volume":"4","author":"Hasi\u0107","year":"2016"},{"key":"S1471068424000115_ref46","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1055\/s-0039-3400749","article-title":"Modeling a clinical pathway for contraception","volume":"10","author":"Sooter","year":"2019","journal-title":"Applied Clinical Informatics"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068424000115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T13:02:52Z","timestamp":1728565372000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068424000115\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["S1471068424000115"],"URL":"https:\/\/doi.org\/10.1017\/s1471068424000115","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"\u00a9 The Author(s), 2024. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}