Finding Similar or Diverse Solutions
		in Answer Set Programming


     Thomas Eiter, Esra Erdem, Halit Erdogan, and Michael Fink

                    
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.