@inproceedings{rcra10,
  urln = {rcra10.pdf},
  author = {Duygu Cakmak and
               Esra Erdem and
               Halit Erdogan},
  booktitle = {Proc. of the 17th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
(RCRA'10)},
  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 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.},
  year = {2010},
  title = {Computing Weighted Solutions in ASP: Representation-Based Method vs. Search-Based Method},
}

{"_id":{"_str":"534224d0ecd21cdc070007c8"},"__v":23,"authorIDs":["5456f0758b01c81930000081","54597963b43425b7720005c1","545eb6896aaec20d23000936","5df0b7a08367c8de010000ce","5df87bbedb7d9ddf01000044","5e4957a916841dde01000031","u493trvfaXuB4g9PZ"],"author_short":["Cakmak, D.","Erdem, E.","Erdogan, H."],"bibbaseid":"cakmak-erdem-erdogan-computingweightedsolutionsinasprepresentationbasedmethodvssearchbasedmethod-2010","bibdata":{"bibtype":"inproceedings","type":"inproceedings","urln":"rcra10.pdf","author":[{"firstnames":["Duygu"],"propositions":[],"lastnames":["Cakmak"],"suffixes":[]},{"firstnames":["Esra"],"propositions":[],"lastnames":["Erdem"],"suffixes":[]},{"firstnames":["Halit"],"propositions":[],"lastnames":["Erdogan"],"suffixes":[]}],"booktitle":"Proc. of the 17th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'10)","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 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.","year":"2010","title":"Computing Weighted Solutions in ASP: Representation-Based Method vs. Search-Based Method","bibtex":"@inproceedings{rcra10,\n urln = {rcra10.pdf},\n author = {Duygu Cakmak and\n Esra Erdem and\n Halit Erdogan},\n booktitle = {Proc. of the 17th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion\n(RCRA'10)},\n abstract = {For some problems with many solutions, like planning and phylogeny\nreconstruction, one way to compute more desirable solutions is to assign\nweights to solutions, and then pick the ones whose weights are over (resp.\nbelow) a threshold. This paper studies computing weighted solutions to such\nproblems in Answer Set Programming. We investigate two sorts of methods\nfor computing weighted solutions: one suggests modifying the representation\nof the problem and the other suggests modifying the search procedure\nof the answer set solver. We show the applicability and the effectiveness\nof these methods in reconstructing weighted phylogenies for Indo-European\nlanguages. We also compare these methods in terms of computational efficiency;\nthe experimental results show that the search-based method is better.},\n year = {2010},\n title = {Computing Weighted Solutions in ASP: Representation-Based Method vs. Search-Based Method},\n}\n\n","author_short":["Cakmak, D.","Erdem, E.","Erdogan, H."],"key":"rcra10","id":"rcra10","bibbaseid":"cakmak-erdem-erdogan-computingweightedsolutionsinasprepresentationbasedmethodvssearchbasedmethod-2010","role":"author","urls":{"N":"http://pages.cs.wisc.edu/~halit/papers/rcra10.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://pages.cs.wisc.edu/~halit/papers/haliterdoganpub.bib","downloads":0,"keywords":[],"search_terms":["computing","weighted","solutions","asp","representation","based","method","search","based","method","cakmak","erdem","erdogan"],"title":"Computing Weighted Solutions in ASP: Representation-Based Method vs. Search-Based Method","year":2010,"dataSources":["h6pbJnSkCa6JsKHC7","FnnA3hAZggjATcKDh"]}