@inproceedings{csw10,
  author    = {Halit Erdogan},
  title     = {{Quantifying solutions in answer set programming}},
  booktitle = {Proc. of the 1st Computer Science Student Workshop (CSW'10)},
  year      = {2010},
  urlN		= {csw-halit.pdf},
  abstract  = {Answer Set Programming (ASP) is a declarative
programming paradigm oriented towards solving
NP-hard problems. Due to the expressive representation
language and efficient solvers, ASP
can be useful for a wide-range of knowledgeintensive
applications from different fields. In
ASP, the idea is to provide a declarative representation
of the problem as an ASP program
whose models (called answer sets) correspond to
solutions. Since many problems have numerous
solutions, instead of computing all solutions, it
is sometimes desirable to compute a subset of
preferred solutions. With this motivation, we
present novel methods to quantify answer sets in
ASP for extracting preferred solutions only. We
show the effectiveness of these methods on real
world applications.},
  }

{"_id":{"_str":"534224d0ecd21cdc070007d1"},"__v":11,"authorIDs":["5456f0758b01c81930000081","54597963b43425b7720005c1","5df0b7a08367c8de010000ce","5df87bbedb7d9ddf01000044","5e4957a916841dde01000031","u493trvfaXuB4g9PZ"],"author_short":["Erdogan, H."],"bibbaseid":"erdogan-quantifyingsolutionsinanswersetprogramming-2010","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Halit"],"propositions":[],"lastnames":["Erdogan"],"suffixes":[]}],"title":"Quantifying solutions in answer set programming","booktitle":"Proc. of the 1st Computer Science Student Workshop (CSW'10)","year":"2010","urln":"csw-halit.pdf","abstract":"Answer Set Programming (ASP) is a declarative programming paradigm oriented towards solving NP-hard problems. Due to the expressive representation language and efficient solvers, ASP can be useful for a wide-range of knowledgeintensive applications from different fields. In ASP, the idea is to provide a declarative representation of the problem as an ASP program whose models (called answer sets) correspond to solutions. Since many problems have numerous solutions, instead of computing all solutions, it is sometimes desirable to compute a subset of preferred solutions. With this motivation, we present novel methods to quantify answer sets in ASP for extracting preferred solutions only. We show the effectiveness of these methods on real world applications.","bibtex":"@inproceedings{csw10,\n author = {Halit Erdogan},\n title = {{Quantifying solutions in answer set programming}},\n booktitle = {Proc. of the 1st Computer Science Student Workshop (CSW'10)},\n year = {2010},\n urlN\t\t= {csw-halit.pdf},\n abstract = {Answer Set Programming (ASP) is a declarative\nprogramming paradigm oriented towards solving\nNP-hard problems. Due to the expressive representation\nlanguage and efficient solvers, ASP\ncan be useful for a wide-range of knowledgeintensive\napplications from different fields. In\nASP, the idea is to provide a declarative representation\nof the problem as an ASP program\nwhose models (called answer sets) correspond to\nsolutions. Since many problems have numerous\nsolutions, instead of computing all solutions, it\nis sometimes desirable to compute a subset of\npreferred solutions. With this motivation, we\npresent novel methods to quantify answer sets in\nASP for extracting preferred solutions only. We\nshow the effectiveness of these methods on real\nworld applications.},\n }\n \n","author_short":["Erdogan, H."],"key":"csw10","id":"csw10","bibbaseid":"erdogan-quantifyingsolutionsinanswersetprogramming-2010","role":"author","urls":{"N":"http://pages.cs.wisc.edu/~halit/papers/csw-halit.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://pages.cs.wisc.edu/~halit/papers/haliterdoganpub.bib","downloads":0,"keywords":[],"search_terms":["quantifying","solutions","answer","set","programming","erdogan"],"title":"Quantifying solutions in answer set programming","year":2010,"dataSources":["h6pbJnSkCa6JsKHC7","FnnA3hAZggjATcKDh"]}