@misc{KaminskiSchaubSiegeletal.2013,
  author    = {Kaminski, Roland and Schaub, Torsten H. and Siegel, Anne and Videla, Santiago},
  title     = {Minimal intervention strategies in logical signaling networks with ASP},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  number    = {4-5},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41570},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-415704},
  pages     = {675 -- 690},
  year      = {2013},
  abstract  = {Proposing relevant perturbations to biological signaling networks is central to many problems in biology and medicine because it allows for enabling or disabling certain biological outcomes. In contrast to quantitative methods that permit fine-grained (kinetic) analysis, qualitative approaches allow for addressing large-scale networks. This is accomplished by more abstract representations such as logical networks. We elaborate upon such a qualitative approach aiming at the computation of minimal interventions in logical signaling networks relying on Kleene's three-valued logic and fixpoint semantics. We address this problem within answer set programming and show that it greatly outperforms previous work using dedicated algorithms.},
  language  = {en}
}
@misc{GebserKaminskiSchaub2011,
  author    = {Gebser, Martin and Kaminski, Roland and Schaub, Torsten H.},
  title     = {Complex optimization in answer set programming},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {554},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41243},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-412436},
  pages     = {19},
  year      = {2011},
  abstract  = {Preference handling and optimization are indispensable means for addressing nontrivial applications in Answer Set Programming (ASP). However, their implementation becomes difficult whenever they bring about a significant increase in computational complexity. As a consequence, existing ASP systems do not offer complex optimization capacities, supporting, for instance, inclusion-based minimization or Pareto efficiency. Rather, such complex criteria are typically addressed by resorting to dedicated modeling techniques, like saturation. Unlike the ease of common ASP modeling, however, these techniques are rather involved and hardly usable by ASP laymen. We address this problem by developing a general implementation technique by means of meta-prpogramming, thus reusing existing ASP systems to capture various forms of qualitative preferences among answer sets. In this way, complex preferences and optimization capacities become readily available for ASP applications.},
  language  = {en}
}
@misc{HoosKaminskiLindaueretal.2015,
  author    = {Hoos, Holger and Kaminski, Roland and Lindauer, Marius and Schaub, Torsten H.},
  title     = {aspeed},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {588},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41474},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-414743},
  pages     = {26},
  year      = {2015},
  abstract  = {Although Boolean Constraint Technology has made tremendous progress over the last decade, the efficacy of state-of-the-art solvers is known to vary considerably across different types of problem instances, and is known to depend strongly on algorithm parameters. This problem was addressed by means of a simple, yet effective approach using handmade, uniform, and unordered schedules of multiple solvers in ppfolio, which showed very impressive performance in the 2011 Satisfiability Testing (SAT) Competition. Inspired by this, we take advantage of the modeling and solving capacities of Answer Set Programming (ASP) to automatically determine more refined, that is, nonuniform and ordered solver schedules from the existing benchmarking data. We begin by formulating the determination of such schedules as multi-criteria optimization problems and provide corresponding ASP encodings. The resulting encodings are easily customizable for different settings, and the computation of optimum schedules can mostly be done in the blink of an eye, even when dealing with large runtime data sets stemming from many solvers on hundreds to thousands of instances. Also, the fact that our approach can be customized easily enabled us to swiftly adapt it to generate parallel schedules for multi-processor machines.},
  language  = {en}
}
@misc{GebserHarrisonKaminskietal.2015,
  author    = {Gebser, Martin and Harrison, Amelia and Kaminski, Roland and Lifschitz, Vladimir and Schaub, Torsten H.},
  title     = {Abstract gringo},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {592},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41475},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-414751},
  pages     = {15},
  year      = {2015},
  abstract  = {This paper defines the syntax and semantics of the input language of the ASP grounder gringo. The definition covers several constructs that were not discussed in earlier work on the semantics of that language, including intervals, pools, division of integers, aggregates with non-numeric values, and lparse-style aggregate expressions. The definition is abstract in the sense that it disregards some details related to representing programs by strings of ASCII characters. It serves as a specification for gringo from Version 4.5 on.},
  language  = {en}
}