Decomposition Methods for Solving Scheduling Problem Using Answer Set Programming

Mohammed M. S. El-Kholany

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence

Doctoral Consortium. Pages 5849-5850.

https://doi.org/10.24963/ijcai.2022/827

PDF BibTeX

Abstract

This study proposes solving scheduling problems in industrial applications using the decomposition approach. The proposed model has been built using Multi-shot Answer Set Programming with Difference Logic. We tested our model with some benchmark instances and the results showed that our model is comparable to Constraint Programming to other heuristics in the literature.

Keywords

  • Knowledge Representation and Reasoning (KRR): General
Welcome Future Conferences AI Journal Division IJCAI Proceedings Travel Grant Program IJCAI Awards