TY - BOOK A1 - Fuhrmann, Michaela A1 - Schubarth, Wilfried A1 - Schulze-Reichelt, Friederike A1 - Mauermeister, Sylvi A1 - Seidel, Andreas A1 - Hartmann, Nina A1 - Erdmann, Melinda A1 - Apostolow, Benjamin A1 - Wagner, Laura A1 - Berndt, Sarah A1 - Wippermann, Melanie A1 - Ratzlaff, Olaf A1 - Lumpe, Matthias A1 - Kirjuchina, Ljuba A1 - Rost, Sophia A1 - Zurek, Peter Paul A1 - Faaß, Marcel A1 - Schellhorn, Sebastian A1 - Frank, Mario A1 - Kreitz, Christoph A1 - Wagner, Nelli A1 - Jenneck, Julia A1 - Kleemann, Katrin A1 - Vock, Miriam A1 - Schröder, Christian A1 - Erdmann, Kathrin A1 - Koziol, Matthias A1 - Meißner, Marlen A1 - Dibiasi, Anna A1 - Unger, Martin A1 - Piskunova, Elena V. A1 - Bahmutskiy, Andrey E. A1 - Bessonova, Ekatarina A. A1 - Borovik, Ludmila K. ED - Schubarth, Wilfried ED - Mauermeister, Sylvi ED - Schulze-Reichelt, Friederike ED - Seidel, Andreas T1 - Alles auf Anfang! BT - Befunde und Perspektiven zum Studieneingang T3 - Potsdamer Beiträge zur Hochschulforschung N2 - Im Zuge der Bologna-Reform ist an Hochschulen vieles in Bewegung gekommen. Studium und Lehre sind stärker ins Blickfeld gerückt. Dabei kommt der Studieneingangsphase besondere Bedeutung zu, werden doch hier die Weichen für ein erfolgreiches Studium gestellt. Deshalb ist es verständlich, dass die Hauptanstrengungen der Hochschulen auf den Studieneingang gerichtet sind – ganz nach dem Motto: „Auf den Anfang kommt es an!“. Konsens herrscht dahingehend, dass der Studieneingang neu zu gestalten ist, doch beim „Wie?“ gibt es unterschiedliche Antworten. Zugleich wird immer deutlicher, dass eine wirksame Neugestaltung der Eingangsphase nur mit einer umfassenden Reform des Studiums gelingen kann. Ziel des vierten Bandes der Potsdamer Beiträge zur Hochschulforschung ist es, eine Zwischenbilanz der Debatte zum Studieneingang zu ziehen. Auf der Basis empirischer Studien werden unterschiedliche Perspektiven auf den Studieneingang eingenommen und Empfehlungen zur Optimierung des Studieneingangs abgeleitet. Die zahlreichen Untersuchungsergebnisse Potsdamer Forschergruppen werden durch weitere nationale sowie internationale Perspektiven ergänzt. Der Band richtet sich an alle, die sich für die Entwicklung an Hochschulen interessieren. T3 - Potsdamer Beiträge zur Hochschulforschung - 4 Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-422965 SN - 978-3-86956-452-4 SN - 2192-1075 SN - 2192-1083 IS - 4 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - JOUR A1 - Schellhorn, Sebastian A1 - Frank, Mario A1 - Kreitz, Christoph T1 - Brückenkurse für mathematische und informatiknahe Studiengänge JF - Alles auf Anfang! Befunde und Perspektiven zum Studieneingang Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-428538 SN - 978-3-86956-452-4 SN - 2192-1075 SN - 2192-1083 SP - 257 EP - 271 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - JOUR A1 - Janhunen, Tomi A1 - Kaminski, Roland A1 - Ostrowski, Max A1 - Schellhorn, Sebastian A1 - Wanko, Philipp A1 - Schaub, Torsten H. T1 - Clingo goes linear constraints over reals and integers JF - Theory and practice of logic programming N2 - The recent series 5 of the Answer Set Programming (ASP) system clingo provides generic means to enhance basic ASP with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints and elaborate upon its formal properties. Given this, we discuss the respective implementations, and present techniques for using these constraints in a reactive context. More precisely, we introduce extensions to clingo with difference and linear constraints over integers and reals, respectively, and realize them in complementary ways. Finally, we empirically evaluate the resulting clingo derivatives clingo[dl] and clingo[lp] on common language fragments and contrast them to related ASP systems. KW - Constraint Answer Set Programming (CASP) KW - Answer Set Programming (ASP) KW - Constraint Processing (CP) KW - Theory Solving Y1 - 2017 U6 - https://doi.org/10.1017/S1471068417000242 SN - 1471-0684 SN - 1475-3081 VL - 17 SP - 872 EP - 888 PB - Cambridge Univ. Press CY - New York ER - TY - JOUR A1 - Cabalar, Pedro A1 - Fandinno, Jorge A1 - Schaub, Torsten H. A1 - Schellhorn, Sebastian T1 - Gelfond-Zhang aggregates as propositional formulas JF - Artificial intelligence N2 - Answer Set Programming (ASP) has become a popular and widespread paradigm for practical Knowledge Representation thanks to its expressiveness and the available enhancements of its input language. One of such enhancements is the use of aggregates, for which different semantic proposals have been made. In this paper, we show that any ASP aggregate interpreted under Gelfond and Zhang's (GZ) semantics can be replaced (under strong equivalence) by a propositional formula. Restricted to the original GZ syntax, the resulting formula is reducible to a disjunction of conjunctions of literals but the formulation is still applicable even when the syntax is extended to allow for arbitrary formulas (including nested aggregates) in the condition. Once GZ-aggregates are represented as formulas, we establish a formal comparison (in terms of the logic of Here-and-There) to Ferraris' (F) aggregates, which are defined by a different formula translation involving nested implications. In particular, we prove that if we replace an F-aggregate by a GZ-aggregate in a rule head, we do not lose answer sets (although more can be gained). This extends the previously known result that the opposite happens in rule bodies, i.e., replacing a GZ-aggregate by an F-aggregate in the body may yield more answer sets. Finally, we characterize a class of aggregates for which GZ- and F-semantics coincide. KW - Aggregates KW - Answer Set Programming Y1 - 2019 U6 - https://doi.org/10.1016/j.artint.2018.10.007 SN - 0004-3702 SN - 1872-7921 VL - 274 SP - 26 EP - 43 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Frioux, Clémence A1 - Schaub, Torsten H. A1 - Schellhorn, Sebastian A1 - Siegel, Anne A1 - Wanko, Philipp T1 - Hybrid metabolic network completion JF - Theory and practice of logic programming N2 - Metabolic networks play a crucial role in biology since they capture all chemical reactions in an organism. While there are networks of high quality for many model organisms, networks for less studied organisms are often of poor quality and suffer from incompleteness. To this end, we introduced in previous work an answer set programming (ASP)-based approach to metabolic network completion. Although this qualitative approach allows for restoring moderately degraded networks, it fails to restore highly degraded ones. This is because it ignores quantitative constraints capturing reaction rates. To address this problem, we propose a hybrid approach to metabolic network completion that integrates our qualitative ASP approach with quantitative means for capturing reaction rates. We begin by formally reconciling existing stoichiometric and topological approaches to network completion in a unified formalism. With it, we develop a hybrid ASP encoding and rely upon the theory reasoning capacities of the ASP system dingo for solving the resulting logic program with linear constraints over reals. We empirically evaluate our approach by means of the metabolic network of Escherichia coli. Our analysis shows that our novel approach yields greatly superior results than obtainable from purely qualitative or quantitative approaches. KW - answer set programming KW - metabolic network KW - gap-filling KW - linear programming KW - hybrid solving KW - bioinformatics Y1 - 2018 U6 - https://doi.org/10.1017/S1471068418000455 SN - 1471-0684 SN - 1475-3081 VL - 19 IS - 1 SP - 83 EP - 108 PB - Cambridge University Press CY - New York ER - TY - GEN A1 - Cabalar, Pedro A1 - Fandinno, Jorge A1 - Schaub, Torsten H. A1 - Schellhorn, Sebastian T1 - Lower Bound Founded Logic of Here-and-There T2 - Logics in Artificial Intelligence N2 - A distinguishing feature of Answer Set Programming is that all atoms belonging to a stable model must be founded. That is, an atom must not only be true but provably true. This can be made precise by means of the constructive logic of Here-and-There, whose equilibrium models correspond to stable models. One way of looking at foundedness is to regard Boolean truth values as ordered by letting true be greater than false. Then, each Boolean variable takes the smallest truth value that can be proven for it. This idea was generalized by Aziz to ordered domains and applied to constraint satisfaction problems. As before, the idea is that a, say integer, variable gets only assigned to the smallest integer that can be justified. In this paper, we present a logical reconstruction of Aziz’ idea in the setting of the logic of Here-and-There. More precisely, we start by defining the logic of Here-and-There with lower bound founded variables along with its equilibrium models and elaborate upon its formal properties. Finally, we compare our approach with related ones and sketch future work. Y1 - 2019 SN - 978-3-030-19570-0 SN - 978-3-030-19569-4 U6 - https://doi.org/10.1007/978-3-030-19570-0_34 SN - 0302-9743 SN - 1611-3349 VL - 11468 SP - 509 EP - 525 PB - Springer CY - Cham ER - TY - JOUR A1 - Gebser, Martin A1 - Kaminski, Roland A1 - Kaufmann, Benjamin A1 - Lühne, Patrick A1 - Obermeier, Philipp A1 - Ostrowski, Max A1 - Romero Davila, Javier A1 - Schaub, Torsten H. A1 - Schellhorn, Sebastian A1 - Wanko, Philipp T1 - The Potsdam Answer Set Solving Collection 5.0 JF - Künstliche Intelligenz N2 - The Potsdam answer set solving collection, or Potassco for short, bundles various tools implementing and/or applying answer set programming. The article at hand succeeds an earlier description of the Potassco project published in Gebser et al. (AI Commun 24(2):107-124, 2011). Hence, we concentrate in what follows on the major features of the most recent, fifth generation of the ASP system clingo and highlight some recent resulting application systems. Y1 - 2018 U6 - https://doi.org/10.1007/s13218-018-0528-x SN - 0933-1875 SN - 1610-1987 VL - 32 IS - 2-3 SP - 181 EP - 182 PB - Springer CY - Heidelberg ER -