English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In Answer Set Programming (ASP), the user can define declaratively a problemand solve it with efficient solvers; practical applications of ASP arecountless and several constraint problems have been successfully solved withASP. On the other hand, solution time usually grows in a superlinear way(often, exponential) with respect to the size of the instance, which isimpractical for large instances. A widely used approach is to split theoptimization problem into sub-problems that are solved in sequence, somecommitting to the values assigned by others, and reconstructing a validassignment for the whole problem by juxtaposing the solutions of the singlesub-problems. On the one hand this approach is much faster, due to thesuperlinear behavior; on the other hand, it does not provide any guarantee ofoptimality: committing to the assignment of one sub-problem can rule out theoptimal solution from the search space. In other research areas, Logic-BasedBenders Decomposition (LBBD) proved effective; in LBBD, the problem isdecomposed into a Master Problem (MP) and one or several Sub-Problems (SP). Thesolution of the MP is passed to the SPs, that can possibly fail. In case offailure, a no-good is returned to the MP, that is solved again with theaddition of the new constraint. The solution process is iterated until a validsolution is obtained for all the sub-problems or the MP is proven infeasible.The obtained solution is provably optimal under very mild conditions. In thispaper, we apply for the first time LBBD to ASP, exploiting an application inhealth care as case study. Experimental results show the effectiveness of theapproach. We believe that the availability of LBBD can further increase thepractical applicability of ASP technologies.

Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling