Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/56216
-
Title: 
Shift Design with Answer Set Programming
-
Citation: 
Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 32–39). Springer. https://doi.org/10.1007/978-3-319-23264-5_4
-
Publisher DOI: 
10.1007/978-3-319-23264-5_4
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Abseher, Michael 
Gebser, Martin 
Musliu, Nysret 
Schaub, Torsten 
Woltran, Stefan 
-
Organisational Unit: 
E192-02 - Forschungsbereich Databases and Artificial Intelligence 
-
Published in: 
Logic Programming and Nonmonotonic Reasoning 
-
Date (published): 
2015
-
Event name: 
13th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2015 
-
Event date: 
27-Sep-2015 - 30-Sep-2015
-
Event place: 
Lexington, Kentucky, USA, Non-EU
-
Number of Pages: 
8
-
Publisher: 
Springer, Lecture Notes in Computer Science Volume 9345
-
Peer reviewed: 
Yes
-
Abstract: 
Answer Set Programming (ASP) is a powerful declarative programming paradigm that has been successfully applied to many different domains. Recently, ASP has also proved successful for hard optimization problems like course timetabling. In this paper, we approach another important task, namely, the shift design problem, aiming at an alignment of a minimum number of shifts in order to meet required numbers of employees (which typically vary for different time periods) in such a way that over- and understaffing is minimized. We provide an ASP encoding of the shift design problem, which, to the best of our knowledge, has not been addressed by ASP yet.
en
Project title: 
Artificial Intelligence in Employee Scheduling: P 24814-N23 (Fonds zur Förderung der wissenschaftlichen Forschung (FWF)) 
Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving: P25607-N23 (Fonds zur Förderung der wissenschaftlichen Forschung (FWF)) 
START: Y 698-N23 (Fonds zur Förderung der wissenschaftlichen Forschung (FWF)) 
-
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

235
checked on Nov 22, 2023

Google ScholarTM

Check