Optimality-preserving Logic-Based Benders Decomposition of Answer Set Programs
A theoretical analysis of the conditions under which LBBD, including cuts, can preserve optimality in the context of Answer Set Programming (ASP), a prominent logic-based language in the field of Artificial Intelligence and introduces a general-purpose algorithm that preserves the optimality guarantees of Bender Decomposition.