Solution Enumeration by Optimality in Answer Set Programming

DOI10.1017/s1471068421000375zbMath1530.68058arXiv2108.03474MaRDI QIDQ6063865

Unnamed Author, Tomi Janhunen

Publication date: 12 December 2023

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.03474

zbMATH Keywords

samplingBayesian networksoptimization problemsanswer-set programmingsolution enumeration

Mathematics Subject Classification ID

Logic programming (68N17) Probabilistic graphical models (62H22)

Related Items (1)

Enumeration of minimal models and MUSes in WASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design and results of the Fifth Answer Set Programming Competition
• Extending and implementing the stable model semantics
• On the computational cost of disjunctive logic programming: Propositional case
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• On probabilistic inference by weighted model counting
• Combinatorial optimization. Theory and applications.
• Improving the Normalization of Weight Rules in Answer Set Programs
• Solution Enumeration for Projected Boolean Search Problems
• Autoepistemic logic
• Rewriting recursive aggregates in answer set programming: back to monotonicity
• ASP-Core-2 Input Language Format
• Reducibility among Combinatorial Problems
• Conflict-Driven Answer Set Enumeration
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

This page was built for publication: Solution Enumeration by Optimality in Answer Set Programming