Computing Weighted Solutions in Answer Set Programming

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.

• Type: Conference
• Year: 2009
• Where: LPNMR
• Authors: Duygu Çakmak, Esra Erdem, Halit Erdogan
• Keywords: Answer Set, LPNMR 2009, Phylogeny Reconstruction, Weighted Solutions