@article{AhmadShoaibPrinetto2015,
  author    = {Ahmad, Nadeem and Shoaib, Umar and Prinetto, Paolo},
  title     = {Usability of Online Assistance From Semiliterate Users' Perspective},
  series = {International journal of human computer interaction},
  volume    = {31},
  journal   = {International journal of human computer interaction},
  number    = {1},
  publisher = {Taylor \& Francis Group},
  address   = {Philadelphia},
  issn      = {1044-7318},
  doi       = {10.1080/10447318.2014.925772},
  pages     = {55 -- 64},
  year      = {2015},
  language  = {en}
}
@article{LamprechtMargaria2015,
  author    = {Lamprecht, Anna-Lena and Margaria, Tiziana},
  title     = {Scientific workflows and XMDD},
  series = {Process design for natural scientists},
  journal   = {Process design for natural scientists},
  editor    = {Lamprecht, Anna-Lena and Margaria, Tiziana},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {978-3-662-45006-2},
  pages     = {1 -- 13},
  year      = {2015},
  language  = {en}
}
@article{GruenewaldMeinel2015,
  author    = {Gr{\"u}newald, Franka and Meinel, Christoph},
  title     = {Implementation and Evaluation of Digital E-Lecture Annotation in Learning Groups to Foster Active Learning},
  series = {IEEE transactions on learning technologies},
  volume    = {8},
  journal   = {IEEE transactions on learning technologies},
  number    = {3},
  publisher = {Inst. of Electr. and Electronics Engineers},
  address   = {Los Alamitos},
  issn      = {1939-1382},
  doi       = {10.1109/TLT.2015.2396042},
  pages     = {286 -- 298},
  year      = {2015},
  abstract  = {The use of video lectures in distance learning involves the two major problems of searchability and active user participation. In this paper, we promote the implementation and usage of a collaborative educational video annotation functionality to overcome these two challenges. Different use cases and requirements, as well as details of the implementation, are explained. Furthermore, we suggest more improvements to foster a culture of participation and an algorithm for the extraction of semantic data. Finally, evaluations in the form of user tests and questionnaires in a MOOC setting are presented. The results of the evaluation are promising, as they indicate not only that students perceive it as useful, but also that the learning effectiveness increases. The combination of personal lecture video annotations with a semantic topic map was also evaluated positively and will thus be investigated further, as will the implementation in a MOOC context.},
  language  = {en}
}
@article{Broeker2015,
  author    = {Br{\"o}ker, Kathrin},
  title     = {Unterst{\"u}tzung Informatik-Studierender durch ein Lernzentrum},
  series = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  volume    = {2015},
  journal   = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  number    = {9},
  editor    = {Schubert, Sigrid and Schwill, Andreas},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-84754},
  pages     = {189 -- 197},
  year      = {2015},
  abstract  = {In diesem Papier wird das Konzept eines Lernzentrums f{\"u}r die Informatik (LZI) an der Universit{\"a}t Paderborn vorgestellt. Ausgehend von den fachspezifischen Schwierigkeiten der Informatik Studierenden werden die Angebote des LZIs erl{\"a}utert, die sich {\"u}ber die vier Bereiche Individuelle Beratung und Betreuung, „Offener Lernraum", Workshops und Lehrveranstaltungen sowie Forschung erstrecken. Eine erste Evaluation mittels Feedbackb{\"o}gen zeigt, dass das Angebot bei den Studierenden positiv aufgenommen wird. Zuk{\"u}nftig soll das Angebot des LZIs weiter ausgebaut und verbessert werden. Ausgangsbasis dazu sind weitere Studien.},
  language  = {de}
}
@article{OmranianMuellerRoeberNikoloski2015,
  author    = {Omranian, Nooshin and M{\"u}ller-R{\"o}ber, Bernd and Nikoloski, Zoran},
  title     = {Segmentation of biological multivariate time-series data},
  series = {Scientific reports},
  volume    = {5},
  journal   = {Scientific reports},
  publisher = {Nature Publ. Group},
  address   = {London},
  issn      = {2045-2322},
  doi       = {10.1038/srep08937},
  pages     = {6},
  year      = {2015},
  abstract  = {Time-series data from multicomponent systems capture the dynamics of the ongoing processes and reflect the interactions between the components. The progression of processes in such systems usually involves check-points and events at which the relationships between the components are altered in response to stimuli. Detecting these events together with the implicated components can help understand the temporal aspects of complex biological systems. Here we propose a regularized regression-based approach for identifying breakpoints and corresponding segments from multivariate time-series data. In combination with techniques from clustering, the approach also allows estimating the significance of the determined breakpoints as well as the key components implicated in the emergence of the breakpoints. Comparative analysis with the existing alternatives demonstrates the power of the approach to identify biologically meaningful breakpoints in diverse time-resolved transcriptomics data sets from the yeast Saccharomyces cerevisiae and the diatom Thalassiosira pseudonana.},
  language  = {en}
}
@article{LindauerHoosHutteretal.2015,
  author    = {Lindauer, Marius and Hoos, Holger H. and Hutter, Frank and Schaub, Torsten},
  title     = {An automatically configured algorithm selector},
  series = {The journal of artificial intelligence research},
  volume    = {53},
  journal   = {The journal of artificial intelligence research},
  publisher = {AI Access Foundation},
  address   = {Marina del Rey},
  issn      = {1076-9757},
  pages     = {745 -- 778},
  year      = {2015},
  abstract  = {Algorithm selection (AS) techniques - which involve choosing from a set of algorithms the one expected to solve a given problem instance most efficiently - have substantially improved the state of the art in solving many prominent AI problems, such as SAT, CSP, ASP, MAXSAT and QBF. Although several AS procedures have been introduced, not too surprisingly, none of them dominates all others across all AS scenarios. Furthermore, these procedures have parameters whose optimal values vary across AS scenarios. This holds specifically for the machine learning techniques that form the core of current AS procedures, and for their hyperparameters. Therefore, to successfully apply AS to new problems, algorithms and benchmark sets, two questions need to be answered: (i) how to select an AS approach and (ii) how to set its parameters effectively. We address both of these problems simultaneously by using automated algorithm configuration. Specifically, we demonstrate that we can automatically configure claspfolio 2, which implements a large variety of different AS approaches and their respective parameters in a single, highly-parameterized algorithm framework. Our approach, dubbed AutoFolio, allows researchers and practitioners across a broad range of applications to exploit the combined power of many different AS methods. We demonstrate AutoFolio can significantly improve the performance of claspfolio 2 on 8 out of the 13 scenarios from the Algorithm Selection Library, leads to new state-of-the-art algorithm selectors for 7 of these scenarios, and matches state-of-the-art performance (statistically) on all other scenarios. Compared to the best single algorithm for each AS scenario, AutoFolio achieves average speedup factors between 1.3 and 15.4.},
  language  = {en}
}
@article{VidelaGuziolowskiEduatietal.2015,
  author    = {Videla, Santiago and Guziolowski, Carito and Eduati, Federica and Thiele, Sven and Gebser, Martin and Nicolas, Jacques and Saez-Rodriguez, Julio and Schaub, Torsten and Siegel, Anne},
  title     = {Learning Boolean logic models of signaling networks with ASP},
  series = {Theoretical computer science},
  volume    = {599},
  journal   = {Theoretical computer science},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0304-3975},
  doi       = {10.1016/j.tcs.2014.06.022},
  pages     = {79 -- 101},
  year      = {2015},
  abstract  = {Boolean networks provide a simple yet powerful qualitative modeling approach in systems biology. However, manual identification of logic rules underlying the system being studied is in most cases out of reach. Therefore, automated inference of Boolean logical networks from experimental data is a fundamental question in this field. This paper addresses the problem consisting of learning from a prior knowledge network describing causal interactions and phosphorylation activities at a pseudo-steady state, Boolean logic models of immediate-early response in signaling transduction networks. The underlying optimization problem has been so far addressed through mathematical programming approaches and the use of dedicated genetic algorithms. In a recent work we have shown severe limitations of stochastic approaches in this domain and proposed to use Answer Set Programming (ASP), considering a simpler problem setting. Herein, we extend our previous work in order to consider more realistic biological conditions including numerical datasets, the presence of feedback-loops in the prior knowledge network and the necessity of multi-objective optimization. In order to cope with such extensions, we propose several discretization schemes and elaborate upon our previous ASP encoding. Towards real-world biological data, we evaluate the performance of our approach over in silico numerical datasets based on a real and large-scale prior knowledge network. The correctness of our encoding and discretization schemes are dealt with in Appendices A-B. (C) 2014 Elsevier B.V. All rights reserved.},
  language  = {en}
}
@article{HoosKaminskiLindaueretal.2015,
  author    = {Hoos, Holger and Kaminski, Roland and Lindauer, Marius and Schaub, Torsten},
  title     = {aspeed: Solver scheduling via answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {15},
  journal   = {Theory and practice of logic programming},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068414000015},
  pages     = {117 -- 142},
  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}
}
@article{Kujath2016,
  author    = {Kujath, Bertold},
  title     = {Lernwirksamkeits- und Zielgruppenanalyse f{\"u}r ein Lehrvideo zum informatischen Probleml{\"o}sen},
  series = {Commentarii informaticae didacticae (CID)},
  journal   = {Commentarii informaticae didacticae (CID)},
  number    = {10},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-376-3},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-94797},
  pages     = {25 -- 39},
  year      = {2016},
  abstract  = {Aus einer Vergleichsstudie mit starken und schwachen Probleml{\"o}sern konnten Erkenntnisse {\"u}ber die effizienten Herangehensweisen von Hochleistern an Informatikprobleme gewonnen werden. Diese Erkenntnisse wurden in einem Lehrvideo zum informatischen Probleml{\"o}sen didaktisch aufgearbeitet, sodass Lernenden der Einsatz von Baumstrukturen und Rekursion im konkreten Kontext gezeigt werden kann. Nun wurde die tats{\"a}chliche Lernwirksamkeit des Videos sowie die Definition der Zielgruppe in einer Vergleichsstudie mit 66 Studienanf{\"a}ngern {\"u}berpr{\"u}ft.},
  language  = {de}
}
@article{BoehneKreitzKnobelsdorf2016,
  author    = {B{\"o}hne, Sebastian and Kreitz, Christoph and Knobelsdorf, Maria},
  title     = {Mathematisches Argumentieren und Beweisen mit dem Theorembeweiser Coq},
  series = {Commentarii informaticae didacticae (CID)},
  journal   = {Commentarii informaticae didacticae (CID)},
  number    = {10},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-376-3},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-94824},
  pages     = {69 -- 80},
  year      = {2016},
  abstract  = {Informatik-Studierende haben in der Mehrzahl Schwierigkeiten, einen Einstieg in die Theoretische Informatik zu finden und die Leistungsanforderungen in den Endklausuren der zugeh{\"o}rigen Lehrveranstaltungen zu erf{\"u}llen. Wir argumentieren, dass dieser Symptomatik mangelnde Kompetenzen im Umgang mit abstrakten und stark formalisierten Themeninhalten zugrunde liegen und schlagen vor, einen Beweisassistenten als interaktives Lernwerkzeug in der Eingangslehre der Theoretischen Informatik zu nutzen, um entsprechende Kompetenzen zu st{\"a}rken.},
  language  = {de}
}
@article{LagriffoulAndres2016,
  author    = {Lagriffoul, Fabien and Andres, Benjamin},
  title     = {Combining task and motion planning},
  series = {The international journal of robotics research},
  volume    = {35},
  journal   = {The international journal of robotics research},
  number    = {8},
  publisher = {Sage Science Press},
  address   = {Thousand Oaks},
  issn      = {1741-3176},
  doi       = {10.1177/0278364915619022},
  pages     = {890 -- 927},
  year      = {2016},
  abstract  = {Solving problems combining task and motion planning requires searching across a symbolic search space and a geometric search space. Because of the semantic gap between symbolic and geometric representations, symbolic sequences of actions are not guaranteed to be geometrically feasible. This compels us to search in the combined search space, in which frequent backtracks between symbolic and geometric levels make the search inefficient.We address this problem by guiding symbolic search with rich information extracted from the geometric level through culprit detection mechanisms.},
  language  = {en}
}
@article{BaedkeSchoettler2017,
  author    = {Baedke, Jan and Sch{\"o}ttler, Tobias},
  title     = {Visual Metaphors in the Sciences},
  series = {Journal for General Philosophy of Science},
  volume    = {48},
  journal   = {Journal for General Philosophy of Science},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {0925-4560},
  doi       = {10.1007/s10838-016-9353-9},
  pages     = {173 -- 194},
  year      = {2017},
  abstract  = {Recent philosophical analyses of the epistemic dimension of images in the sciences show a certain trend in acknowledging potential roles of these images beyond their merely decorative or pedagogical functions. We argue, however, that this new debate has yet paid little attention to a special type of pictures, we call 'visual metaphor', and its versatile heuristic potential in organizing data, supporting communication, and guiding research, modeling, and theory formation. Based on a case study of Conrad Hal Waddington's epigenetic landscape images in biology, we develop a descriptive framework applicable to heuristic roles of various visual metaphors in the sciences.},
  language  = {en}
}
@article{GebserMarateaRicca2017,
  author    = {Gebser, Martin and Maratea, Marco and Ricca, Francesco},
  title     = {The sixth answer set programming competition},
  series = {Journal of artificial intelligence research : JAIR},
  volume    = {60},
  journal   = {Journal of artificial intelligence research : JAIR},
  publisher = {AI Access Found.},
  address   = {Marina del Rey},
  issn      = {1076-9757},
  doi       = {10.1613/jair.5373},
  pages     = {41 -- 95},
  year      = {2017},
  abstract  = {Answer Set Programming (ASP) is a well-known paradigm of declarative programming with roots in logic programming and non-monotonic reasoning. Similar to other closely related problemsolving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advancements in ASP solving are assessed in competition events. In this paper, we report about the design and results of the Sixth ASP Competition, which was jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genoa (Italy), in affiliation with the 13th International Conference on Logic Programming and Non-Monotonic Reasoning. This edition maintained some of the design decisions introduced in 2014, e.g., the conception of sub-tracks, the scoring scheme,and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the topperforming systems are given more time for solving hard benchmarks.},
  language  = {en}
}
@article{BailisDillahuntMuelleretal.2017,
  author    = {Bailis, Peter and Dillahunt, Tawanna and M{\"u}ller, Stefanie and Baudisch, Patrick},
  title     = {Research for Practice: Technology for Underserved Communities; Personal Fabrication},
  series = {Communications of the ACM / Association for Computing Machinery},
  volume    = {60},
  journal   = {Communications of the ACM / Association for Computing Machinery},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {0001-0782},
  doi       = {10.1145/3080188},
  pages     = {46 -- 49},
  year      = {2017},
  abstract  = {THIS INSTALLMENT OF Research for Practice provides curated reading guides to technology for underserved communities and to new developments in personal fabrication. First, Tawanna Dillahunt describes design considerations and technology for underserved and impoverished communities. Designing for the more than 1.6 billion impoverished individuals worldwide requires special consideration of community needs, constraints, and context. Her selections span protocols for poor-quality communication networks, community-driven content generation, and resource and public service discovery. Second, Stefanie Mueller and Patrick Baudisch provide an overview of recent advances in personal fabrication (for example, 3D printers).},
  language  = {en}
}
@article{LindauerHoosLeytonBrownetal.2017,
  author    = {Lindauer, Marius and Hoos, Holger and Leyton-Brown, Kevin and Schaub, Torsten},
  title     = {Automatic construction of parallel portfolios via algorithm configuration},
  series = {Artificial intelligence},
  volume    = {244},
  journal   = {Artificial intelligence},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2016.05.004},
  pages     = {272 -- 290},
  year      = {2017},
  abstract  = {Since 2004, increases in computational power described by Moore's law have substantially been realized in the form of additional cores rather than through faster clock speeds. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for propositional satisfiability (SAT), one of the most widely studied NP-complete problems, can be produced automatically from any existing sequential, highly parametric SAT solver. Our Automatic Construction of Parallel Portfolios (ACPP) approach uses an automatic algorithm configuration procedure to identify a set of configurations that perform well when executed in parallel. Applied to two prominent SAT solvers, Lingeling and clasp, our ACPP procedure identified 8-core solvers that significantly outperformed their sequential counterparts on a diverse set of instances from the application and hard combinatorial category of the 2012 SAT Challenge. We further extended our ACPP approach to produce parallel portfolio solvers consisting of several different solvers by combining their configuration spaces. Applied to the component solvers of the 2012 SAT Challenge gold medal winning SAT Solver pfolioUZK, our ACPP procedures produced a significantly better-performing parallel SAT solver.},
  language  = {en}
}
@article{BaierDiCiccioMendlingetal.2018,
  author    = {Baier, Thomas and Di Ciccio, Claudio and Mendling, Jan and Weske, Mathias},
  title     = {Matching events and activities by integrating behavioral aspects and label analysis},
  series = {Software and systems modeling},
  volume    = {17},
  journal   = {Software and systems modeling},
  number    = {2},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {1619-1366},
  doi       = {10.1007/s10270-017-0603-z},
  pages     = {573 -- 598},
  year      = {2018},
  abstract  = {Nowadays, business processes are increasingly supported by IT services that produce massive amounts of event data during the execution of a process. These event data can be used to analyze the process using process mining techniques to discover the real process, measure conformance to a given process model, or to enhance existing models with performance information. Mapping the produced events to activities of a given process model is essential for conformance checking, annotation and understanding of process mining results. In order to accomplish this mapping with low manual effort, we developed a semi-automatic approach that maps events to activities using insights from behavioral analysis and label analysis. The approach extracts Declare constraints from both the log and the model to build matching constraints to efficiently reduce the number of possible mappings. These mappings are further reduced using techniques from natural language processing, which allow for a matching based on labels and external knowledge sources. The evaluation with synthetic and real-life data demonstrates the effectiveness of the approach and its robustness toward non-conforming execution logs.},
  language  = {en}
}
@article{PrzybyllaRomeike2018,
  author    = {Przybylla, Mareen and Romeike, Ralf},
  title     = {Empowering learners with tools in CS education},
  series = {it - Information Technology},
  volume    = {60},
  journal   = {it - Information Technology},
  number    = {2},
  publisher = {De Gruyter},
  address   = {Berlin},
  issn      = {1611-2776},
  doi       = {10.1515/itit-2017-0032},
  pages     = {91 -- 101},
  year      = {2018},
  abstract  = {In computer science, computer systems are both, objects of investigation and tools that enable creative learning and design. Tools for learning have a long tradition in computer science education. Already in the late 1960s, Papert developed a concept which had an immense impact on the development of informal education in the following years: his theory of constructionism understands learning as a creative process of knowledge construction that is most effective when learners create something purposeful that they can try out, show around, discuss, analyse and receive praise for. By now, there are numerous learning and programming environments that are based on the constructionist ideas. Modern tools offer opportunities for students to learn in motivating ways and gain impressive results in programming games, animations, implementing 3D models or developing interactive objects. This article gives an overview of computer science education research related to tools and media to be used in educational settings. We analyse different types of tools with a special focus on the categorization and development of tools for student adequate physical computing activities in the classroom. Research around the development and evaluation of tools and learning resources in the domain of physical computing is illustrated with the example of "My Interactive Garden", a constructionist learning and programming environment. It is explained how the results from empirical studies are integrated in the continuous development of the learning material.},
  language  = {en}
}
@article{PrescherBornscheinKoehlmannetal.2018,
  author    = {Prescher, Denise and Bornschein, Jens and K{\"o}hlmann, Wiebke and Weber, Gerhard},
  title     = {Touching graphical applications},
  series = {Universal Access in the Information Society},
  volume    = {17},
  journal   = {Universal Access in the Information Society},
  number    = {2},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {1615-5289},
  doi       = {10.1007/s10209-017-0538-8},
  pages     = {391 -- 409},
  year      = {2018},
  abstract  = {Novel two-dimensional tactile displays enable blind users to not only get access to the textual but also to the graphical content of a graphical user interface. Due to the higher amount of information that can be presented in parallel, orientation and exploration can be more complex. In this paper we present the HyperBraille system, which consists of a pin-matrix device as well as a graphical screen reader providing the user with appropriate presentation and interaction possibilities. To allow for a detailed analysis of bimanual interaction strategies on a pin-matrix device, we conducted two user studies with a total of 12 blind people. The task was to fill in .pdf forms on the pin-matrix device by using different input methods, namely gestures, built-in hardware buttons as well as a conventional PC keyboard. The forms were presented in a semigraphic view type that not only contains Braille but also tactile widgets in a spatial arrangement. While completion time and error rate partly depended on the chosen input method, the usage of special reading strategies seemed to be independent of it. A direct comparison of the system and a conventional assistive technology (screen reader with single-line Braille device) showed that interaction on the pin-matrix device can be very efficient if the user is trained. The two-dimensional output can improve access to .pdf forms with insufficient accessibility as the mapping of input controls and the corresponding labels can be supported by a spatial presentation.},
  language  = {en}
}
@article{AfantenosPeldszusStede2018,
  author    = {Afantenos, Stergos and Peldszus, Andreas and Stede, Manfred},
  title     = {Comparing decoding mechanisms for parsing argumentative structures},
  series = {Argument \& Computation},
  volume    = {9},
  journal   = {Argument \& Computation},
  number    = {3},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {1946-2166},
  doi       = {10.3233/AAC-180033},
  pages     = {177 -- 192},
  year      = {2018},
  abstract  = {Parsing of argumentative structures has become a very active line of research in recent years. Like discourse parsing or any other natural language task that requires prediction of linguistic structures, most approaches choose to learn a local model and then perform global decoding over the local probability distributions, often imposing constraints that are specific to the task at hand. Specifically for argumentation parsing, two decoding approaches have been recently proposed: Minimum Spanning Trees (MST) and Integer Linear Programming (ILP), following similar trends in discourse parsing. In contrast to discourse parsing though, where trees are not always used as underlying annotation schemes, argumentation structures so far have always been represented with trees. Using the 'argumentative microtext corpus' [in: Argumentation and Reasoned Action: Proceedings of the 1st European Conference on Argumentation, Lisbon 2015 / Vol. 2, College Publications, London, 2016, pp. 801-815] as underlying data and replicating three different decoding mechanisms, in this paper we propose a novel ILP decoder and an extension to our earlier MST work, and then thoroughly compare the approaches. The result is that our new decoder outperforms related work in important respects, and that in general, ILP and MST yield very similar performance.},
  language  = {en}
}
@article{GianniniRichterServettoetal.2018,
  author    = {Giannini, Paola and Richter, Tim and Servetto, Marco and Zucca, Elena},
  title     = {Tracing sharing in an imperative pure calculus},
  series = {Science of computer programming},
  volume    = {172},
  journal   = {Science of computer programming},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0167-6423},
  doi       = {10.1016/j.scico.2018.11.007},
  pages     = {180 -- 202},
  year      = {2018},
  abstract  = {We introduce a type and effect system, for an imperative object calculus, which infers sharing possibly introduced by the evaluation of an expression, represented as an equivalence relation among its free variables. This direct representation of sharing effects at the syntactic level allows us to express in a natural way, and to generalize, widely-used notions in literature, notably uniqueness and borrowing. Moreover, the calculus is pure in the sense that reduction is defined on language terms only, since they directly encode store. The advantage of this non-standard execution model with respect to a behaviorally equivalent standard model using a global auxiliary structure is that reachability relations among references are partly encoded by scoping. (C) 2018 Elsevier B.V. All rights reserved.},
  language  = {en}
}