Finding similar/diverse solutions in answer set programming
From MaRDI portal
Abstract: For some computational problems (e.g., product configuration, planning, diagnosis, query answering, phylogeny reconstruction) computing a set of similar/diverse solutions may be desirable for better decision-making. With this motivation, we studied several decision/optimization versions of this problem in the context of Answer Set Programming (ASP), analyzed their computational complexity, and introduced offline/online methods to compute similar/diverse solutions of such computational problems with respect to a given distance function. All these methods rely on the idea of computing solutions to a problem by means of finding the answer sets for an ASP program that describes the problem. The offline methods compute all solutions in advance using the ASP formulation of the problem with an ASP solver, like Clasp, and then identify similar/diverse solutions using clustering methods. The online methods compute similar/diverse solutions following one of the three approaches: by reformulating the ASP representation of the problem to compute similar/diverse solutions at once using an ASP solver; by computing similar/diverse solutions iteratively (one after other) using an ASP solver; by modifying the search algorithm of an ASP solver to compute similar/diverse solutions incrementally. We modified Clasp to implement the last online method and called it Clasp-NK. In the first two online methods, the given distance function is represented in ASP; in the last one it is implemented in C++. We showed the applicability and the effectiveness of these methods on reconstruction of similar/diverse phylogenies for Indo-European languages, and on several planning problems in Blocks World. We observed that in terms of computational efficiency the last online method outperforms the others; also it allows us to compute similar/diverse solutions when the distance function cannot be represented in ASP.
Recommendations
- Solution Enumeration by Optimality in Answer Set Programming
- Answer Set Programming: A Declarative Approach to Solving Search Problems
- Representing constraint satisfaction problems in answer set programming
- A general method to solve complex problems by combining multiple answer set programs
- scientific article; zbMATH DE number 2090116
- A multiparametric view on answer set programming
- Exploring relations between answer set programs
- On optimal solutions of answer set optimization problems
- Abstract Answer Set Solvers
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- A machine program for theorem-proving
- Algorithms and computation. 11th international conference, ISAAC 2000, Taipei, Taiwan, December 18--20, 2000. Proceedings
- Comparison of phylogenetic trees
- Extending and implementing the stable model semantics
- Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday
- Handbook of Graph Theory
- Heterogeneous active agents, II: Algorithms and complexity
- Inferring phylogenetic trees using answer set programming
- Nested expressions in logic programs
- On the expressibility of stable logic programming
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Sorting by Transpositions
- Temporal phylogenetic networks and logic programming
- The complexity of selecting maximal solutions
- Weight constraints as nested expressions
Cited in
(10)- Computing weighted solutions in ASP: representation-based method vs. search-based method
- Diversity of answers to conjunctive queries
- Computing Diverse Optimal Stable Models
- How to build your own ASP-based system?!
- A general framework for preferences in answer set programming
- A synthesis of automated planning and reinforcement learning for efficient, robust decision-making
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy
- Computing Weighted Solutions in Answer Set Programming
This page was built for publication: Finding similar/diverse solutions in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298797)
