Skip to main content
Conference Proceedings

Finding similar or diverse solutions in answer set programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5649 LNCS 342-356
DOI: 10.1007/978-3-642-02846-5_29
13Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using answer set solvers. We analyze the computational complexity of some problems that are related to finding similar or diverse solutions, and show the applicability and effectiveness of our methods in phylogeny reconstruction. © 2009 Springer Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Eiter, T., Erdem, E., Erdoǧan, H., & Fink, M. (2009). Finding similar or diverse solutions in answer set programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5649 LNCS, pp. 342–356). https://doi.org/10.1007/978-3-642-02846-5_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free