Computing weighted solutions in ASP: representation-based method vs. search-based method
Çakmak, Duygu and Erdoğan, Halit and Erdem, Esra (2010) Computing weighted solutions in ASP: representation-based method vs. search-based method. In: 17th International RCRA workshop (RCRA 2010): Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, Bologna, Italy
Full text not available from this repository.
Official URL: http://ceur-ws.org/Vol-616/paper15.pdf
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 reconstructing weighted phylogenies for Indo-European languages. We also compare these methods in terms of computational efficiency; the experimental results show that the search-based method is better.
Repository Staff Only: item control page