Computing weighted solutions in answer set programming
Çakmak, Duygu and Erdem, Esra and Erdoğan, Halit (2009) Computing weighted solutions in answer set programming. In: 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), Potsdam, Germany
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/978-3-642-04238-6_36
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.
Repository Staff Only: item control page