The goal of this paper is to benchmark Answer Set Programming (ASP) systems to test their performance when dealing with a complex optimization problem. In particular, the problem tackled is resource allocation in the area of Business Process Management (BPM). Like many other scheduling problems, the allocation of resources and starting times to business process activities is a challenging optimization problem for ASP solvers. Our problem encoding is ASP Core-2 standard compliant and it is realized in a declarative and compact fashion. We develop an instance generator that produces problem instances of different size and hardness with respect to adjustable parameters. By using the baseline encoding and the instance generator, we provide a comparison between the two award-winning ASP solvers clasp and wasp and report the grounding performance of gringo and i-dlv. The benchmark suggests that there is room for improvement concerning both the grounders and the solvers. Fostered by the relevance of the problem addressed, of which several variants have been described in different domains, we believe this is a solid application-oriented benchmark for the ASP community. / Series: Working Papers on Information Systems, Information Business and Operations
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:7060 |
| Date | 26 November 2018 |
| Creators | Giray, Havur, Cristina, Cabanillas, Axel, Polleres |
| Publisher | Department fĂĽr Informationsverarbeitung und Prozessmanagement, WU Vienna University of Economics and Business |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Paper, NonPeerReviewed |
| Format | application/pdf |
| Rights | Creative Commons: Attribution 4.0 International (CC BY 4.0) |
| Relation | http://epub.wu.ac.at/7060/ |
Page generated in 0.0019 seconds