Declarative Modelling of Fair Hierarchical Task Allocation Using Answer Set Programming
DOI:
https://doi.org/10.32628/CSEIT25111672Keywords:
Answer Set Programming, Optimization, Fairness, Hard Constraint, Soft Constraint, Task Allocation, Hierarchy, Logic Programming, Declarative ModellingAbstract
Task allocation is a well-known optimization problem that has been widely addressed using techniques such as Integer Programming (IP) and nature-inspired algorithms. However, many existing approaches lack flexibility and contextual awareness, especially in scenarios requiring fairness and hierarchical compliance. This research proposes an optimized Answer Set Programming (ASP) model for the Fair Hierarchical Task Allocation (FHTA) problem. The model incorporates knowledge-based reasoning to support context-specific constraints and generates stable models (answer sets) that satisfy both fairness and organizational hierarchy. A generate-and-test methodology is employed, wherein candidate solutions are produced and evaluated against a set of hard and soft constraints. A realistic problem scenario involving academic task assignment was formalized in ASP, using the Potassco toolkit (Clingo). The performance of the model was evaluated across varying problem sizes, specifically by changing the number of tasks and personnel involved. Metrics such as CPU time and total runtime were recorded. The results show that the ASP model performs efficiently for moderately sized instances and effectively achieves fair and hierarchical task allocation. This work demonstrates that ASP provides a scalable, explainable, and flexible framework for solving complex task allocation problems in hierarchical organizations.
📊 Article Downloads
References
F. Basık, B. Gedik, H. Ferhatosmanoğlu, and K.-L. Wu, “Fair task allocation in crowdsourced delivery,” IEEE Trans. Services Comput., vol. 14, no. 4, pp. 1040–1053, 2021. doi: 10.1109/TSC.2018.2854866. DOI: https://doi.org/10.1109/TSC.2018.2854866
Q. C. Ye, Y. Zhang, and R. Dekker, “Fair task allocation in transportation,” Omega, vol. 64, pp. 83–94, 2016. doi: 10.1016/j.omega.2016.05.005. DOI: https://doi.org/10.1016/j.omega.2016.05.005
Y. Zhao, Y. Xu, Y. Peng, X. Zhao, and X. Xie, “Coalition-based task assignment with priority-aware fairness in spatial crowdsourcing,” VLDB J., vol. 33, no. 1, pp. 163–184, 2023, doi: 10.1007/s00778-023-00802-3. DOI: https://doi.org/10.1007/s00778-023-00802-3
J.-y. Liu, G. Wang, X.-k. Guo, S.-y. Wang, and Q. Fu, “Intelligent air defense task assignment based on hierarchical reinforcement learning,” Front. Neurorobot., vol. 16, Dec. 2022. doi: 10.3389/fnbot.2022.1072887. DOI: https://doi.org/10.3389/fnbot.2022.1072887
T. Zhang, X. Liu, Y. Li, H. Wang, and Y. Liu, “Task allocation in human–machine manufacturing systems using deep reinforcement learning,” Sustainability, vol. 14, no. 4, Art. 2245, 2022. doi: 10.3390/su14042245. DOI: https://doi.org/10.3390/su14042245
“Cooperative multi-robot task allocation with reinforcement learning,” Appl. Sci., vol. 12, no. 1, Art. 272, 2022. (MDPI). doi: 10.3390/app12010272. DOI: https://doi.org/10.3390/app12010272
K. Song, R. Jiang, R. Chandra, and S. Zhang, “Group fairness in multi-task reinforcement learning,” arXiv, Mar. 2025. doi: 10.48550/arXiv.2503.07817.
C. Billing, F. Jaehn, and T. Wensing, “Fair task allocation problem,” Ann. Oper. Res., vol. 284, no. 1, pp. 131–146, Jan. 2020. doi: 10.1007/s10479-018-3052-3. DOI: https://doi.org/10.1007/s10479-018-3052-3
H. Kumar and I. Tyagi, "Task Allocation Model Based on Hierarchical Clustering and Impact of Different Distance Measures on the Performance," International Journal of Fuzzy System Applications (IJFSA), vol. 9, no. 4, pp. 105–133, Oct.–Dec. 2020, doi: 10.4018/IJFSA.2020100105. DOI: https://doi.org/10.4018/IJFSA.2020100105
V. Lifschitz, Answer Set Programming. Springer, 2019. doi: 10.1007/978-3-030-21438-8. DOI: https://doi.org/10.1007/978-3-030-24658-7
E. Erdem, M. Gelfond, and N. Leone, “Applications of answer set programming,” AI Mag., vol. 37, no. 3, pp. 53–68, 2016. doi: 10.1609/aimag.v37i3.2578. DOI: https://doi.org/10.1609/aimag.v37i3.2678
G. Havur, C. Cabanillas, J. Mendling, and A. Polleres, “Resource allocation with dependencies in business process management systems,” in Proc. Business Process Manage. Conf., 2016, pp. 3–19. doi: 10.1007/978-3-319-45468-9_1. DOI: https://doi.org/10.1007/978-3-319-45468-9_1
C. Dodaro, F. Ricca, S. Schüller, and T. Terracina, “An ASP-based solution to the chemotherapy treatment scheduling problem,” Theory Pract. Log. Program., vol. 21, no. 6, pp. 835–851, 2021. doi: 10.1017/S1471068421000512. DOI: https://doi.org/10.1017/S1471068421000363
Potassco, “Clingo: A grounder and solver for logic programs,” GitHub repository, 2025. [Online]. Available: https://github.com/potassco/clingo
M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub, “Clingo = ASP + Control: Preliminary Report,” arXiv, May 2014. link.springer.com+6arxiv.org+6link.springer.com+6
F. Calimeri, M. Fink, S. Germano, W. Ianni, T. Krennwallner, C. Redl, A. Ricca, and G. Terracina, “Developing ASP Programs with ASPIDE and LoIDE,” Künstl. Intell., vol. 32, pp. 185–186, 2018, doi: 10.1007/s13218-018-0534-z. DOI: https://doi.org/10.1007/s13218-018-0534-z
A. Sinha, A. Joshi, R. Bhattacharjee, C. Musco, and M. Hajiesmaili, “No regret Algorithms for Fair Resource Allocation,” in Adv. Neural Inf. Process. Syst. (NeurIPS), vol. 36, 2023.
C. Huang, G. Chen, P. Xiao, J. A. Chambers, and W. Huang, “Fair Resource Allocation for Hierarchical Federated Edge Learning in Space–Air–Ground Integrated Networks via Deep Reinforcement Learning,” arXiv preprint, Aug. 2024. doi: 10.48550/arXiv.2408.02501 DOI: https://doi.org/10.1109/JSAC.2024.3459086
M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub, “Answer Set Solving in Practice,” Synthesis Lectures on Artificial Intelligence and Machine Learning, vol. 6, no. 3, pp. 1–238, 2012. doi: 10.2200/S00457ED1V01Y201211AIM022 DOI: https://doi.org/10.1007/978-3-031-01561-8_1
T. Schaub and S. Woltran, “Preferences in answer set programming,” Theory and Practice of Logic Programming, vol. 6, no. 1–2, pp. 33–90, Jan. 2006. doi: 10.1017/S1471068405002431
Downloads
Published
Issue
Section
License
Copyright (c) 2025 International Journal of Scientific Research in Computer Science, Engineering and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
