Finding similar/diverse solutions in answer set programming
From MaRDI portal
Publication:5298797
DOI10.1017/S1471068411000548zbMath1266.68081arXiv1108.3260MaRDI QIDQ5298797
Esra Erdem, Michael Fink, Thomas Eiter, Halit Erdogan
Publication date: 14 June 2013
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.3260
Related Items (7)
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 ⋮ A general framework for preferences in answer set programming ⋮ Computing weighted solutions in ASP: representation-based method vs. search-based method ⋮ Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy ⋮ Computing Diverse Optimal Stable Models ⋮ Enriching Solutions to Combinatorial Problems via Solution Engineering
Cites Work
- Unnamed Item
- Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday
- Comparison of phylogenetic trees
- Heterogeneous active agents, II: Algorithms and complexity
- Algorithms and computation. 11th international conference, ISAAC 2000, Taipei, Taiwan, December 18--20, 2000. Proceedings
- Extending and implementing the stable model semantics
- The complexity of selecting maximal solutions
- Nested expressions in logic programs
- Inferring phylogenetic trees using answer set programming
- Sorting by Transpositions
- Handbook of Graph Theory
- Weight constraints as nested expressions
- On the expressibility of stable logic programming
- Temporal phylogenetic networks and logic programming
- A machine program for theorem-proving
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
This page was built for publication: Finding similar/diverse solutions in answer set programming
