Computing Weighted Solutions in Answer Set Programming

  • Duygu Çakmak
  • Esra Erdem
  • Halit Erdoğan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5753)

Abstract

For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ones whose weights are over (resp. below) a threshold. This paper studies computing weighted solutions to such problems in Answer Set Programming. We investigate two sorts of methods for computing weighted solutions: one suggests modifying the representation of the problem and the other suggests modifying the search procedure of the answer set solver. We show the applicability and the effectiveness of these methods in phylogeny reconstruction.

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

  • Duygu Çakmak
    • 1
  • Esra Erdem
    • 1
  • Halit Erdoğan
    • 1
  1. 1.Faculty of Engineering and Natural SciencesSabancı UniversityIstanbulTurkey

Personalised recommendations