Cambridge University Press (CUP)
Refine
Has Fulltext
- yes (99)
Document Type
- Postprint (99)
Language
- English (99)
Is part of the Bibliography
- yes (99)
Keywords
- answer set programming (6)
- acquisition (5)
- late bilinguals (4)
- 2nd-language (3)
- constraints (3)
- dementia (3)
- english (3)
- instabilities (3)
- magnetic fields (3)
- representation (3)
Institute
- Mathematisch-Naturwissenschaftliche Fakultät (48)
- Humanwissenschaftliche Fakultät (33)
- Department Linguistik (7)
- Philosophische Fakultät (4)
- Department Psychologie (3)
- Institut für Chemie (2)
- Institut für Informatik und Computational Science (2)
- Wirtschafts- und Sozialwissenschaftliche Fakultät (2)
- Department Sport- und Gesundheitswissenschaften (1)
- Hasso-Plattner-Institut für Digital Engineering GmbH (1)
This article investigates a public debate in Germany that put a special spotlight on the interaction of standard language ideologies with social dichotomies, centering on the question of whether Kiezdeutsch, a new way of speaking in multilingual urban neighbourhoods, is a legitimate German dialect. Based on a corpus of emails and postings to media websites, I analyse central topoi in this debate and an underlying narrative on language and identity. Central elements of this narrative are claims of cultural elevation and cultural unity for an idealised standard language High German', a view of German dialects as part of a national folk culture, and the construction of an exclusive in-group of German' speakers who own this language and its dialects. The narrative provides a potent conceptual frame for the Othering of Kiezdeutsch and its speakers, and for the projection of social and sometimes racist deliminations onto the linguistic plane.
Matching participants (as suggested by Hope, 2015) may be one promising option for research on a potential bilingual advantage in executive functions (EF). In this study we first compared performances in three EF-tasks of a naturally heterogeneous sample of monolingual (n = 69, age = 9.0 y) and multilingual children (n = 57, age = 9.3 y). Secondly, we meticulously matched participants pairwise to obtain two highly homogeneous groups to rerun our analysis and investigate a potential bilingual advantage. The initally disadvantaged multilinguals (regarding socioeconomic status and German lexicon size) performed worse in updating and response inhibition, but similarly in interference inhibition. This indicates that superior EF compensate for the detrimental effects of the background variables. After matching children pairwise on age, gender, intelligence, socioeconomic status and German lexicon size, performances became similar except for interference inhibition. Here, an advantage for multilinguals in the form of globally reduced reaction times emerged, indicating a bilingual executive processing advantage.
The Babylonian Talmud (BT) attributes the idea of committing a transgression for the sake of God to R. Nahman b. Isaac (RNBI). RNBI's statement appears in two parallel sugyot in the BT (Nazir 23a; Horayot 10a). Each sugya has four textual witnesses. By comparing these textual witnesses, this paper will attempt to reconstruct the sugya's earlier (or, what some might term, original) dialectical form, from which the two familiar versions of the text in Nazir and Horayot evolved. This article reveals the specific ways in which, value-laden conceptualizations have a major impact on the Talmud's formulation, as we know it today.
We present XMM-Newton and Chandra observations of the born-again planetary nebula A 30. These X-ray observations reveal a bright unresolved source at the position of the central star whose X-ray luminosity exceeds by far the model expectations for photospheric emission and for shocks within the stellar wind. We suggest that a “born-again hot bubble” may be responsible for this X-ray emission. Diffuse X-ray emission associated with the petal-like features and one of the H-poor knots seen in the optical is also found. The weakened emission of carbon lines in the spectrum of the diffuse emission can be interpreted as the dilution of stellar wind by mass-loading or as the detection of material ejected during a very late thermal pulse.
Abstract gringo
(2015)
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.
This study presents results from a cross-modal priming experiment investigating inflected verb forms of German. A group of late learners of German with Russian as their native language (L1) was compared to a control group of German L1 speakers. The experiment showed different priming patterns for the two participant groups. The L1 German data yielded a stem-priming effect for inflected forms involving regular affixation and a partial priming effect for irregular forms irrespective of stem allomorphy. By contrast, the data from the late bilinguals showed reduced priming effects for both regular and irregular forms. We argue that late learners rely more on lexically stored inflected word forms during word recognition and less on morphological parsing than native speakers.
The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds.
ASP modulo CSP
(2012)
We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude.
aspeed
(2015)
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.
Building biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the degree of automation. However, available approaches often yield a single model only, rely on specific assumptions, and/or use dedicated, heuristic algorithms that are intolerant to changing circumstances or requirements in the view of the rapid progress made in Biotechnology. Our aim is to provide a declarative solution to the problem by appeal to Answer Set Programming (ASP) overcoming these difficulties. We build upon an existing approach to Automatic Network Reconstruction proposed by part of the authors. This approach has firm mathematical foundations and is well suited for ASP due to its combinatorial flavor providing a characterization of all models explaining a set of experiments. The usage of ASP has several benefits over the existing heuristic algorithms. First, it is declarative and thus transparent for biological experts. Second, it is elaboration tolerant and thus allows for an easy exploration and incorporation of biological constraints. Third, it allows for exploring the entire space of possible models. Finally, our approach offers an excellent performance, matching existing, special-purpose systems.