Finding Similar or Diverse Solutions in Answer Set Programming

  • Thomas Eiter
  • Esra Erdem
  • Halit Erdoğan
  • Michael Fink
Conference paper

DOI: 10.1007/978-3-642-02846-5_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5649)
Cite this paper as:
Eiter T., Erdem E., Erdoğan H., Fink M. (2009) Finding Similar or Diverse Solutions in Answer Set Programming. In: Hill P.M., Warren D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg

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.

Keywords

similar/diverse solutions answer set programming phylogenies 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Thomas Eiter
    • 1
  • Esra Erdem
    • 2
  • Halit Erdoğan
    • 2
  • Michael Fink
    • 1
  1. 1.Institute of Information SystemsVienna University of TechnologyViennaAustria
  2. 2.Faculty of Engineering and Natural SciencesSabancı UniversityIstanbulTurkey

Personalised recommendations