@mastersthesis{halitErdogan11,
  author = {Halit Erdogan},
  title = {{Finding Similar/Diverse Solutions in Answer Set Programming:
Theory and Applications}},
  school = {Sabanci University},
  address = {Istanbul, Turkey},
  year = {2011},
  abstract = {For many computational problems, the main concern is to find a best
solution (e.g., a most preferred product configuration, a shortest plan, a most
parsimonious phylogeny) with respect to some well-described criteria. On the other hand,
in many real-world applications, computing a subset of good solutions that are
similar/diverse may be desirable for better decision-making. For one reason, the given
computational problem may have too many good solutions, and the user may want to examine
only a few of them to pick one; in such cases, finding a few similar/diverse good
solutions may be useful. Also, in many real-world applications the users usually take
into account further criteria that are not included in the formulation of the
optimization problem; in such cases, finding a few good solutions that are close to or
distant from a particular set of solutions may be useful.

With this motivation, we have studied various computational problems related to finding
similar/diverse (resp. close/distant) solutions with respect to a given distance
function, in the context of Answer Set Programming (ASP). We have introduced novel
offline/ online computational methods in ASP to solve such computational problems. We
have modified an ASP solver according to one of our online methods, providing a useful
tool (CLASP-NK) for various ASP applications. We have showed the applicability and
effectiveness of our methods/tools in three domains: phylogeny reconstruction, AI
planning, and biomedical query answering. Motivated by the promising results, we have
developed computational tools to be used by the experts in these areas.}
}

{"_id":{"_str":"53424e050e946d920a000682"},"__v":1,"authorIDs":[],"author_short":["Erdogan, H."],"bibbaseid":"erdogan-findingsimilardiversesolutionsinanswersetprogrammingtheoryandapplications-2011","bibdata":{"bibtype":"mastersthesis","type":"mastersthesis","author":[{"firstnames":["Halit"],"propositions":[],"lastnames":["Erdogan"],"suffixes":[]}],"title":"Finding Similar/Diverse Solutions in Answer Set Programming: Theory and Applications","school":"Sabanci University","address":"Istanbul, Turkey","year":"2011","abstract":"For many computational problems, the main concern is to find a best solution (e.g., a most preferred product configuration, a shortest plan, a most parsimonious phylogeny) with respect to some well-described criteria. On the other hand, in many real-world applications, computing a subset of good solutions that are similar/diverse may be desirable for better decision-making. For one reason, the given computational problem may have too many good solutions, and the user may want to examine only a few of them to pick one; in such cases, finding a few similar/diverse good solutions may be useful. Also, in many real-world applications the users usually take into account further criteria that are not included in the formulation of the optimization problem; in such cases, finding a few good solutions that are close to or distant from a particular set of solutions may be useful. With this motivation, we have studied various computational problems related to finding similar/diverse (resp. close/distant) solutions with respect to a given distance function, in the context of Answer Set Programming (ASP). We have introduced novel offline/ online computational methods in ASP to solve such computational problems. We have modified an ASP solver according to one of our online methods, providing a useful tool (CLASP-NK) for various ASP applications. We have showed the applicability and effectiveness of our methods/tools in three domains: phylogeny reconstruction, AI planning, and biomedical query answering. Motivated by the promising results, we have developed computational tools to be used by the experts in these areas.","bibtex":"@mastersthesis{halitErdogan11,\n author = {Halit Erdogan},\n title = {{Finding Similar/Diverse Solutions in Answer Set Programming:\nTheory and Applications}},\n school = {Sabanci University},\n address = {Istanbul, Turkey},\n year = {2011},\n abstract = {For many computational problems, the main concern is to find a best\nsolution (e.g., a most preferred product configuration, a shortest plan, a most\nparsimonious phylogeny) with respect to some well-described criteria. On the other hand,\nin many real-world applications, computing a subset of good solutions that are\nsimilar/diverse may be desirable for better decision-making. For one reason, the given\ncomputational problem may have too many good solutions, and the user may want to examine\nonly a few of them to pick one; in such cases, finding a few similar/diverse good\nsolutions may be useful. Also, in many real-world applications the users usually take\ninto account further criteria that are not included in the formulation of the\noptimization problem; in such cases, finding a few good solutions that are close to or\ndistant from a particular set of solutions may be useful.\n\nWith this motivation, we have studied various computational problems related to finding\nsimilar/diverse (resp. close/distant) solutions with respect to a given distance\nfunction, in the context of Answer Set Programming (ASP). We have introduced novel\noffline/ online computational methods in ASP to solve such computational problems. We\nhave modified an ASP solver according to one of our online methods, providing a useful\ntool (CLASP-NK) for various ASP applications. We have showed the applicability and\neffectiveness of our methods/tools in three domains: phylogeny reconstruction, AI\nplanning, and biomedical query answering. Motivated by the promising results, we have\ndeveloped computational tools to be used by the experts in these areas.}\n}\n\n","author_short":["Erdogan, H."],"key":"halitErdogan11","id":"halitErdogan11","bibbaseid":"erdogan-findingsimilardiversesolutionsinanswersetprogrammingtheoryandapplications-2011","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"mastersthesis","biburl":"http://cogrobo.sabanciuniv.edu/krrpublicationsnew.bib","downloads":0,"keywords":[],"search_terms":["finding","similar","diverse","solutions","answer","set","programming","theory","applications","erdogan"],"title":"Finding Similar/Diverse Solutions in Answer Set Programming: Theory and Applications","year":2011,"dataSources":["tGZRHJKguQssAob5Z"]}