Solution Enumeration by Optimality in Answer Set Programming
Jukka Pajunen, Tomi Janhunen

TL;DR
This paper introduces algorithms for enumerating solutions in Answer Set Programming based on their optimality, enabling efficient access to multiple solutions and applications like sampling Bayesian networks.
Contribution
It presents the first general algorithms for answer set enumeration by optimality, extending existing ASP solvers' capabilities beyond strictly optimal solutions.
Findings
Efficient access to next-best solutions in optimization problems.
ASEO as an effective sampling technique for Bayesian networks.
Demonstrated potential use cases of the proposed enumeration approach.
Abstract
Given a combinatorial search problem, it may be highly useful to enumerate its (all) solutions besides just finding one solution, or showing that none exists. The same can be stated about optimal solutions if an objective function is provided. This work goes beyond the bare enumeration of optimal solutions and addresses the computational task of solution enumeration by optimality (SEO). This task is studied in the context of Answer Set Programming (ASP) where (optimal) solutions of a problem are captured with the answer sets of a logic program encoding the problem. Existing answer-set solvers already support the enumeration of all (optimal) answer sets. However, in this work, we generalize the enumeration of optimal answer sets beyond strictly optimal ones, giving rise to the idea of answer set enumeration in the order of optimality (ASEO). This approach is applicable up to the best k…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
