@inproceedings{LopezTarazonBronstertThiekenetal.2017,
  author    = {L{\´o}pez-Taraz{\´o}n, Jos{\´e} Andr{\´e}s and Bronstert, Axel and Thieken, Annegret and Petrow, Theresia},
  title     = {International symposium on the effects of global change on floods, fluvial geomorphology and related hazards in mountainous rivers},
  series = {Book of Abstracts},
  booktitle = {Book of Abstracts},
  editor    = {L{\´o}pez-Taraz{\´o}n, Jos{\´e} Andr{\´e}s and Bronstert, Axel and Thieken, Annegret and Petrow, Theresia},
  organization    = {Universit{\"a}t Potsdam},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-396922},
  pages     = {104},
  year      = {2017},
  abstract  = {Both Alpine and Mediterranean areas are considered sensitive to so-called global change, considered as the combination of climate and land use changes. All panels on climate evolution predict future scenarios of increasing frequency and magnitude of floods which are likely to lead to huge geomorphic adjustments of river channels so major metamorphosis of fluvial systems is expected as a result of global change. Such pressures are likely to give rise to major ecological and economic changes and challenges that governments need to address as a matter of priority. Changes in river flow regimes associated with global change are therefore ushering in a new era, where there is a critical need to evaluate hydro-geomorphological hazards from headwaters to lowland areas (flooding can be not just a problem related to being under the water). A key question is how our understanding of these hazards associated with global change can be improved; improvement has to come from integrated research which includes the climatological and physical conditions that could influence the hydrology and sediment generation and hence the conveyance of water and sediments (including the river's capacity, i.e. amount of sediment, and competence, i.e. channel deformation) and the vulnerabilities and economic repercussions of changing hydrological hazards (including the evaluation of the hydro-geomorphological risks too). Within this framework, the purpose of this international symposium is to bring together researchers from several disciplines as hydrology, fluvial geomorphology, hydraulic engineering, environmental science, geography, economy (and any other related discipline) to discuss the effects of global change over the river system in relation with floods. The symposium is organized by means of invited talks given by prominent experts, oral lectures, poster sessions and discussion sessions for each individual topic; it will try to improve our understanding of how rivers are likely to evolve as a result of global change and hence address the associated hazards of that fluvial environmental change concerning flooding. Four main topics are going to be addressed: - Modelling global change (i.e. climate and land-use) at relevant spatial (regional, local) and temporal (from the long-term to the single-event) scales. - Measuring and modelling river floods from the hydrological, sediment transport (both suspended and bedload) and channel morphology points of view at different spatial (from the catchment to the reach) and temporal (from the long-term to the single-event) scales. - Evaluation and assessment of current and future river flooding hazards and risks in a global change perspective. - Catchment management to face river floods in a changing world. We are very pleased to welcome you to Potsdam. We hope you will enjoy your participation at the International Symposium on the Effects of Global Change on Floods, Fluvial Geomorphology and Related Hazards in Mountainous Rivers and have an exciting and profitable experience. Finally, we would like to thank all speakers, participants, supporters, and sponsors for their contributions that for sure will make of this event a very remarkable and fruitful meeting. We acknowledge the valuable support of the European Commission (Marie Curie Intra-European Fellowship, Project ''Floodhazards'', PIEF-GA-2013-622468, Seventh EU Framework Programme) and the Deutschen Forschungsgemeinschaft (Research Training Group "Natural Hazards and Risks in a Changing World" (NatRiskChange; GRK 2043/1) as the symposium would not have been possible without their help. Without your cooperation, this symposium would not be either possible or successful.},
  language  = {en}
}
@inproceedings{PatuchovaKleinFranzkeetal.2014,
  author    = {Patuchova, Nadezda B. and Klein, Eckart and Franzke, Jochen and B{\"u}chner, Christiane and Doroshenko, Egor N. and Hoof, Karsten and Zenin, Sergey S. and Thiele, Carmen and Schmidt, Carmen and Fadeev, Vladimir Ivanovič and Dombert, Matthias and Sadovnikova, Galina D. and Schulze, Carola and Luchterhandt, Otto and Syuzyukina, Oxana},
  title     = {Verfassungsentwicklung in Russland und Deutschland : Materialien des russisch-deutschen Symposiums anl{\"a}sslich des 20. Jahrestages der Verfassung der Russischen F{\"o}deration am 25. und 26. September 2013 an der Universit{\"a}t Potsdam},
  editor    = {Fadeev, Vladimir Ivanovič and Schulze, Carola},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-289-6},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-70418},
  pages     = {XI, 149},
  year      = {2014},
  abstract  = {Der Band enth{\"a}lt die Tagungsmaterialien des deutsch-russichen Symposiums zum Thema "Verfassungsentwicklung in Russland und Deutschland", welches am 25. und 26. September 2013 in Potsdam stattfand. Die Tagung wurde anl{\"a}sslich des 20. Jahrestages der russischen Verfassung vom Dezember 2013 durchgef{\"u}hrt. Die inhaltlichen Schwerpunkte bilden die Themen: Verfassungsentstehung, Verfassungs{\"a}nderung, Verfassungsprinzipien, Landesverfassungen, Fortentwicklung der Verfassung durch die Verfassungsgerichtsbarkeit und Grundrechte, die jeweils aus russischer und deutscher Sicht behandelt werden. Erg{\"a}nzend befasst sich jeweils ein Betrag mit aktuellen Problemen der Menschenrechtsverwirklichung in Russland und der Ausl{\"a}nderintegration in Deutschland und Russland im Vergleich.},
  language  = {de}
}
@inproceedings{Karvovskaya2013,
  author    = {Karvovskaya, Lena},
  title     = {'Also' in Ishkashimi : additive particle and sentence connector},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-66097},
  year      = {2013},
  abstract  = {The paper discusses the distribution and meaning of the additive particle -m@s in Ishkashimi. -m@s receives different semantic associations while staying in the same syntactic position. Thus, structurally combined with an object, it can semantically associate with the focused object or with the whole focused VP; similarly, combined with the subject it can semantically associate with the focused subject and with the whole focused sentence.},
  language  = {en}
}
@inproceedings{Roehr2013,
  author    = {R{\"o}hr, Christine Tanja},
  title     = {Information status and prosody : production and perception in German0F*},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-66116},
  year      = {2013},
  abstract  = {In a production experiment and two follow-up perception experiments on read German we investigated the (de-)coding of discourse-new, inferentially and textually accessible and given discourse referents by prosodic means. Results reveal that a decrease in the referent's level of givenness is reflected by an increase in its prosodic prominence (expressed by differences in the status and type of accent used) providing evidence for the relevance of different intermediate types of information status between the poles given and new. Furthermore, perception data indicate that the degree of prosodic prominence can serve as the decisive cue for decoding a referent's level of givenness.},
  language  = {en}
}
@inproceedings{Kimmelmann2013,
  author    = {Kimmelmann, Vadim},
  title     = {Doubling in RSL and NGT : a pragmatic account0F*},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-66102},
  year      = {2013},
  abstract  = {In this paper, doubling in Russian Sign Language and Sign Language of the Netherlands is discussed. In both sign languages different constituents (including verbs, nouns, adjectives, adverbs, and whole clauses) can be doubled. It is shown that doubling in both languages has common functions and exhibits a similar structure, despite some differences. On this basis, a unified pragmatic explanation for many doubling phenomena on both the discourse and the clause-internal levels is provided, namely that the main function of doubling both in RSL and NGT is foregrounding of the doubled information.},
  language  = {en}
}
@inproceedings{Putten2013,
  author    = {Putten, Saskia van},
  title     = {The meaning of the avatime additive particle tsyɛ},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-66081},
  year      = {2013},
  abstract  = {Avatime, a Kwa language of Ghana, has an additive particle tsyɛ that at first sight looks similar to additive particles such as too and also in English. However, on closer inspection, the Avatime particle behaves differently. Contrary to what is usually claimed about additive particles, tsyɛ does not only associate with focused elements. Moreover, unlike its English equivalents, tsyɛ does not come with a requirement of identity between the expressed proposition and an alternative. Instead, it indicates that the proposition it occurs in is similar to or compatible with a presupposed alternative proposition.},
  language  = {en}
}
@inproceedings{Titov2013,
  author    = {Titov, Elena},
  title     = {Scrambling and interfaces},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-66073},
  year      = {2013},
  abstract  = {This paper proposes a novel analysis of the Russian OVS construction and argues that the parametric variation in the availability of OVS cross-linguistically depends on the type of relative interpretative argument prominence that a language encodes via syntactic structure. When thematic and information-structural prominence relations do not coincide, only one of them can be structurally/linearly represented. The relation that is not structurally/linearly encoded must be made visible at the PF interface either via prosody or morphology.},
  language  = {en}
}
@inproceedings{Stavropoulou2013,
  author    = {Stavropoulou, Pepi},
  title     = {On the status of contrast : evidence from the prosodic domain},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-66066},
  year      = {2013},
  abstract  = {Recent models of Information Structure (IS) identify a low level contrast feature that functions within the topic and focus of the utterance. This study investigates the exact nature of this feature based on empirical evidence from a controlled read speech experiment on the prosodic realization of different levels of contrast in Modern Greek. Results indicate that only correction is truly contrastive, and that it is similarly realized in both topic and focus, suggesting that contrast is an independent IS dimension. Non default focus position is further identified as a parameter that triggers a prosodically marked rendition, similar to correction.},
  language  = {en}
}
@inproceedings{GeskeGoltz2010,
  author    = {Geske, Ulrich and Goltz, Hans-Joachim},
  title     = {Efficiency of difference-list programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41563},
  year      = {2010},
  abstract  = {The difference-list technique is described in literature as effective method for extending lists to the right without using calls of append/3. There exist some proposals for automatic transformation of list programs into differencelist programs. However, we are interested in construction of difference-list programs by the programmer, avoiding the need of a transformation step. In [GG09] it was demonstrated, how left-recursive procedures with a dangling call of append/3 can be transformed into right-recursion using the unfolding technique. For simplification of writing difference-list programs using a new cons/2 procedure was introduced. In the present paper, we investigate how efficieny is influenced using cons/2. We measure the efficiency of procedures using accumulator technique, cons/2, DCG's, and difference lists and compute the resulting speedup in respect to the simple procedure definition using append/3. Four Prolog systems were investigated and we found different behaviour concerning the speedup by difference lists. A result of our investigations is, that an often advice given in the literature for avoiding calls append/3 could not be confirmed in this strong formulation.},
  language  = {en}
}
@inproceedings{GoltzPieth2010,
  author    = {Goltz, Hans-Joachim and Pieth, Norbert},
  title     = {A tool for generating partition schedules of multiprocessor systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41556},
  year      = {2010},
  abstract  = {A deterministic cycle scheduling of partitions at the operating system level is supposed for a multiprocessor system. In this paper, we propose a tool for generating such schedules. We use constraint based programming and develop methods and concepts for a combined interactive and automatic partition scheduling system. This paper is also devoted to basic methods and techniques for modeling and solving this partition scheduling problem. Initial application of our partition scheduling tool has proved successful and demonstrated the suitability of the methods used.},
  language  = {en}
}
@inproceedings{BetzRaiserFruehwirth2010,
  author    = {Betz, Hariolf and Raiser, Frank and Fr{\"u}hwirth, Thom},
  title     = {Persistent constraints in constraint handling rules},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41547},
  year      = {2010},
  abstract  = {In the most abstract definition of its operational semantics, the declarative and concurrent programming language CHR is trivially non-terminating for a significant class of programs. Common refinements of this definition, in closing the gap to real-world implementations, compromise on declarativity and/or concurrency. Building on recent work and the notion of persistent constraints, we introduce an operational semantics avoiding trivial non-termination without compromising on its essential features.},
  language  = {en}
}
@inproceedings{AbdennadherIsmailKhoury2010,
  author    = {Abdennadher, Slim and Ismail, Haythem and Khoury, Frederick},
  title     = {Transforming imperative algorithms to constraint handling rules},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41533},
  year      = {2010},
  abstract  = {Different properties of programs, implemented in Constraint Handling Rules (CHR), have already been investigated. Proving these properties in CHR is fairly simpler than proving them in any type of imperative programming language, which triggered the proposal of a methodology to map imperative programs into equivalent CHR. The equivalence of both programs implies that if a property is satisfied for one, then it is satisfied for the other. The mapping methodology could be put to other beneficial uses. One such use is the automatic generation of global constraints, at an attempt to demonstrate the benefits of having a rule-based implementation for constraint solvers.},
  language  = {en}
}
@inproceedings{Brass2010,
  author    = {Brass, Stefan},
  title     = {Range restriction for general formulas},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41521},
  year      = {2010},
  abstract  = {Deductive databases need general formulas in rule bodies, not only conjuctions of literals. This is well known since the work of Lloyd and Topor about extended logic programming. Of course, formulas must be restricted in such a way that they can be effectively evaluated in finite time, and produce only a finite number of new tuples (in each iteration of the TP-operator: the fixpoint can still be infinite). It is also necessary to respect binding restrictions of built-in predicates: many of these predicates can be executed only when certain arguments are ground. Whereas for standard logic programming rules, questions of safety, allowedness, and range-restriction are relatively easy and well understood, the situation for general formulas is a bit more complicated. We give a syntactic analysis of formulas that guarantees the necessary properties.},
  language  = {en}
}
@inproceedings{BandaGallagher2010,
  author    = {Banda, Gourinath and Gallagher, John P.},
  title     = {Constraint-based abstraction of a model checker for infinite state systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41516},
  year      = {2010},
  abstract  = {Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be verified. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.},
  language  = {en}
}
@inproceedings{HerreHummel2010,
  author    = {Herre, Heinrich and Hummel, Axel},
  title     = {Stationary generated models of generalized logic programs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41501},
  year      = {2010},
  abstract  = {The interest in extensions of the logic programming paradigm beyond the class of normal logic programs is motivated by the need of an adequate representation and processing of knowledge. One of the most difficult problems in this area is to find an adequate declarative semantics for logic programs. In the present paper a general preference criterion is proposed that selects the 'intended' partial models of generalized logic programs which is a conservative extension of the stationary semantics for normal logic programs of [Prz91]. The presented preference criterion defines a partial model of a generalized logic program as intended if it is generated by a stationary chain. It turns out that the stationary generated models coincide with the stationary models on the class of normal logic programs. The general wellfounded semantics of such a program is defined as the set-theoretical intersection of its stationary generated models. For normal logic programs the general wellfounded semantics equals the wellfounded semantics.},
  language  = {en}
}
@inproceedings{HerreHummel2010,
  author    = {Herre, Heinrich and Hummel, Axel},
  title     = {A paraconsistent semantics for generalized logic programs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41496},
  year      = {2010},
  abstract  = {We propose a paraconsistent declarative semantics of possibly inconsistent generalized logic programs which allows for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any specific connective, such as negation(-as-failure), nor on any specific syntax of rules). For consistent generalized logic programs this semantics coincides with the stable generated models introduced in [HW97], and for normal logic programs it yields the stable models in the sense of [GL88].},
  language  = {en}
}
@inproceedings{OetschSchwengererTompits2010,
  author    = {Oetsch, Johannes and Schwengerer, Martin and Tompits, Hans},
  title     = {Kato: a plagiarism-detection tool for answer-set programs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41485},
  year      = {2010},
  abstract  = {We present the tool Kato which is, to the best of our knowledge, the first tool for plagiarism detection that is directly tailored for answer-set programming (ASP). Kato aims at finding similarities between (segments of) logic programs to help detecting cases of plagiarism. Currently, the tool is realised for DLV programs but it is designed to handle various logic-programming syntax versions. We review basic features and the underlying methodology of the tool.},
  language  = {en}
}
@inproceedings{Cabalar2010,
  author    = {Cabalar, Pedro},
  title     = {Existential quantifiers in the rule body},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41476},
  year      = {2010},
  abstract  = {In this paper we consider a simple syntactic extension of Answer Set Programming (ASP) for dealing with (nested) existential quantifiers and double negation in the rule bodies, in a close way to the recent proposal RASPL-1. The semantics for this extension just resorts to Equilibrium Logic (or, equivalently, to the General Theory of Stable Models), which provides a logic-programming interpretation for any arbitrary theory in the syntax of Predicate Calculus. We present a translation of this syntactic class into standard logic programs with variables (either disjunctive or normal, depending on the input rule heads), as those allowed by current ASP solvers. The translation relies on the introduction of auxiliary predicates and the main result shows that it preserves strong equivalence modulo the original signature.},
  language  = {en}
}
@inproceedings{GebserHinrichsSchaubetal.2010,
  author    = {Gebser, Martin and Hinrichs, Henrik and Schaub, Torsten H. and Thiele, Sven},
  title     = {xpanda: a (simple) preprocessor for adding multi-valued propositions to ASP},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41466},
  year      = {2010},
  abstract  = {We introduce a simple approach extending the input language of Answer Set Programming (ASP) systems by multi-valued propositions. Our approach is implemented as a (prototypical) preprocessor translating logic programs with multi-valued propositions into logic programs with Boolean propositions only. Our translation is modular and heavily benefits from the expressive input language of ASP. The resulting approach, along with its implementation, allows for solving interesting constraint satisfaction problems in ASP, showing a good performance.},
  language  = {en}
}
@inproceedings{Seipel2010,
  author    = {Seipel, Dietmar},
  title     = {Practical Applications of Extended Deductive Databases in DATALOG*},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41457},
  year      = {2010},
  abstract  = {A wide range of additional forward chaining applications could be realized with deductive databases, if their rule formalism, their immediate consequence operator, and their fixpoint iteration process would be more flexible. Deductive databases normally represent knowledge using stratified Datalog programs with default negation. But many practical applications of forward chaining require an extensible set of user-defined built-in predicates. Moreover, they often need function symbols for building complex data structures, and the stratified fixpoint iteration has to be extended by aggregation operations. We present an new language Datalog*, which extends Datalog by stratified meta-predicates (including default negation), function symbols, and user-defined built-in predicates, which are implemented and evaluated top-down in Prolog. All predicates are subject to the same backtracking mechanism. The bottom-up fixpoint iteration can aggregate the derived facts after each iteration based on user-defined Prolog predicates.},
  language  = {en}
}