Learning to Break Symmetries for Efficient Optimization in Answer Set Programming

The ability to efficiently solve hard combinatorial optimization problems is a key prerequisite to various applications of declarative programming paradigms. Symmetries in solution candidates pose a significant challenge to modern optimization algorithms since the enumeration of such candidates might substantially reduce their performance. This paper proposes a novel approach using Inductive Logic Programming (ILP) to lift symmetry-breaking constraints for optimization problems modeled in Answer Set Programming (ASP). Given an ASP encoding with optimization statements and a set of small representative instances, our method augments ground ASP programs with auxiliary normal rules enabling the identification of symmetries using existing tools, like SBASS. Then, the obtained symmetries are lifted to first-order constraints with ILP. We prove the correctness of our method and evaluate it on real-world optimization problems from the domain of automated configuration. Our experiments show significant improvements of optimization performance due to the learned first-order constraints.

Authors

• Alice Tarzariol University of Klagenfurt
• Martin Gebser University of Klagenfurt Graz University of Technology
• Konstantin Schekotihin University of Klagenfurt
• Mark Law ILASP Limited

Keywords

• KRR: Knowledge Acquisition
• KRR: Logic Programming
• KRR: Nonmonotonic Reasoning