@incollection{GanghofSchulze2023,
  author    = {Ganghof, Steffen and Schulze, Kai},
  title     = {Vetospieler und Institutionen},
  series = {Handbuch Policy-Forschung},
  booktitle = {Handbuch Policy-Forschung},
  editor    = {Wenzelburger, Georg and Zohlnh{\"o}fer, Reimut},
  edition   = {2., aktualisierte und erweiterte},
  publisher = {Springer},
  address   = {Wiesbaden},
  isbn      = {978-3-658-34559-4},
  doi       = {10.1007/978-3-658-34560-0_4},
  pages     = {101 -- 125},
  year      = {2023},
  abstract  = {Der Beitrag widmet sich zwei {\"u}beraus fruchtbaren theoretischen Ans{\"a}tzen in der Policy-Forschung und dar{\"u}ber hinaus: der Vetospielertheorie und Vetopunkt-Ans{\"a}tzen. Neben den Grundz{\"u}gen beider Ans{\"a}tze stellen wir grundlegende Entwicklungslinien und Probleme dieser Literaturen anhand beispielhafter Studien dar. Es zeigt sich, dass beide Ans{\"a}tze teils kontroverse Annahmen treffen, zu denen es plausible Alternativen gibt. Zum Beispiel kann das Verhalten von Koalitionsparteien im Policy-Prozess anders als von der Vetospielertheorie angenommen modelliert werden. Die kausalen Effekte bestimmter Institutionen oder Vetopunkte k{\"o}nnen zudem je nach Kontext variieren. Diesem Kontext sollte gr{\"o}ßere Beachtung geschenkt werden.},
  language  = {de}
}
@phdthesis{Konczak2007,
  author    = {Konczak, Kathrin},
  title     = {Preferences in answer set programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-12058},
  school      = {Universit{\"a}t Potsdam},
  year      = {2007},
  abstract  = {Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm, having its roots in nonmonotonic reasoning, deductive databases, and logic programming with negation as failure. The basic idea of ASP is to represent a computational problem as a logic program whose answer sets correspond to solutions, and then to use an answer set solver for finding answer sets of the program. ASP is particularly suited for solving NP-complete search problems. Among these, we find applications to product configuration, diagnosis, and graph-theoretical problems, e.g. finding Hamiltonian cycles. On different lines of ASP research, many extensions of the basic formalism have been proposed. The most intensively studied one is the modelling of preferences in ASP. They constitute a natural and effective way of selecting preferred solutions among a plethora of solutions for a problem. For example, preferences have been successfully used for timetabling, auctioning, and product configuration. In this thesis, we concentrate on preferences within answer set programming. Among several formalisms and semantics for preference handling in ASP, we concentrate on ordered logic programs with the underlying D-, W-, and B-semantics. In this setting, preferences are defined among rules of a logic program. They select preferred answer sets among (standard) answer sets of the underlying logic program. Up to now, those preferred answer sets have been computed either via a compilation method or by meta-interpretation. Hence, the question comes up, whether and how preferences can be integrated into an existing ASP solver. To solve this question, we develop an operational graph-based framework for the computation of answer sets of logic programs. Then, we integrate preferences into this operational approach. We empirically observe that our integrative approach performs in most cases better than the compilation method or meta-interpretation. Another research issue in ASP are optimization methods that remove redundancies, as also found in database query optimizers. For these purposes, the rather recently suggested notion of strong equivalence for ASP can be used. If a program is strongly equivalent to a subprogram of itself, then one can always use the subprogram instead of the original program, a technique which serves as an effective optimization method. Up to now, strong equivalence has not been considered for logic programs with preferences. In this thesis, we tackle this issue and generalize the notion of strong equivalence to ordered logic programs. We give necessary and sufficient conditions for the strong equivalence of two ordered logic programs. Furthermore, we provide program transformations for ordered logic programs and show in how far preferences can be simplified. Finally, we present two new applications for preferences within answer set programming. First, we define new procedures for group decision making, which we apply to the problem of scheduling a group meeting. As a second new application, we reconstruct a linguistic problem appearing in German dialects within ASP. Regarding linguistic studies, there is an ongoing debate about how unique the rule systems of language are in human cognition. The reconstruction of grammatical regularities with tools from computer science has consequences for this debate: if grammars can be modelled this way, then they share core properties with other non-linguistic rule systems.},
  language  = {en}
}
@phdthesis{Heinze2023,
  author    = {Heinze, Peter Eric},
  title     = {An exploration of activity and therapist preferences and their predictors in German-speaking samples},
  doi       = {10.25932/publishup-60753},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-607534},
  school      = {Universit{\"a}t Potsdam},
  pages     = {195},
  year      = {2023},
  abstract  = {According to current definitions of evidence-based practice, patients' preferences play an important role for the psychotherapeutic process and outcomes. However, whereas a significant body of research investigated preferences regarding specific treatments, research on preferred activities or therapist characteristics is rare, investigated heterogeneous aspects with inconclusive results, lacked validated assessment tools, and neglected relevant preferences, their predictors as well as the perspective of mental health professionals. Therefore, the three studies of this dissertation aimed to address the most fundamental drawbacks in current preference research by providing a validated questionnaire, focus efforts on activity and therapist preferences and add preferences of psychotherapy trainees. To this end, Paper I reports the translation and validation of the 18-item Cooper-Norcross Inventory of Preference (C-NIP) in a broad, heterogeneous sample of N = 969 laypeople, resulting in good to acceptable reliabilities and first evidence of validity. However, the original factor structure was not replicated. Paper II assesses activity preferences of psychotherapists in training using the C-NIP and compares them with the initial laypeople sample. There were significant differences between both samples, with trainees preferring a more patient-directed, emotionally intense and confrontational approach than laypeople. CBT trainees preferred a more therapist-directed, present-focused, challenging and less emotional intense approach than psychodynamic or -analytic trainees. Paper III explores therapist preferences and tests predictors for specific preference choices. For most characteristics, more than half of the participants did not have specific preferences. Results pointed towards congruency effects (i.e., preference for similar characteristics), especially for members of marginalized groups. The dissertation provides both researchers and practitioners with a validated questionnaire, shows potentially obstructive differences between patients and therapists and underlines the importance of therapist characteristics for marginalized groups, thereby laying the foundation for future applications and implementations in research and practice.},
  language  = {en}
}