@inproceedings{GonzalezCasacuberta2008,
  author    = {Gonz{\´a}lez, Jorge and Casacuberta, Francisco},
  title     = {Phrase-based finite state models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27209},
  year      = {2008},
  abstract  = {In the last years, statistical machine translation has already demonstrated its usefulness within a wide variety of translation applications. In this line, phrase-based alignment models have become the reference to follow in order to build competitive systems. Finite state models are always an interesting framework because there are well-known efficient algorithms for their representation and manipulation. This document is a contribution to the evolution of finite state models towards a phrase-based approach. The inference of stochastic transducers that are based on bilingual phrases is carefully analysed from a finite state point of view. Indeed, the algorithmic phenomena that have to be taken into account in order to deal with such phrase-based finite state models when in decoding time are also in-depth detailed.},
  language  = {en}
}
@phdthesis{Ruch2010,
  author    = {Ruch, Jo{\"e}l},
  title     = {Volcano deformation analysis in the Lazufre area (central Andes) using geodetic and geological observations},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-47361},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {Large-scale volcanic deformation recently detected by radar interferometry (InSAR) provides new information and thus new scientific challenges for understanding volcano-tectonic activity and magmatic systems. The destabilization of such a system at depth noticeably affects the surrounding environment through magma injection, ground displacement and volcanic eruptions. To determine the spatiotemporal evolution of the Lazufre volcanic area located in the central Andes, we combined short-term ground displacement acquired by InSAR with long-term geological observations. Ground displacement was first detected using InSAR in 1997. By 2008, this displacement affected 1800 km2 of the surface, an area comparable in size to the deformation observed at caldera systems. The original displacement was followed in 2000 by a second, small-scale, neighbouring deformation located on the Lastarria volcano. We performed a detailed analysis of the volcanic structures at Lazufre and found relationships with the volcano deformations observed with InSAR. We infer that these observations are both likely to be the surface expression of a long-lived magmatic system evolving at depth. It is not yet clear whether Lazufre may trigger larger unrest or volcanic eruptions; however, the second deformation detected at Lastarria and the clear increase of the large-scale deformation rate make this an area of particular interest for closer continuous monitoring.},
  language  = {en}
}
@book{WistSchaeferVogleretal.2010,
  author    = {Wist, Dominic and Schaefer, Mark and Vogler, Walter and Wollowski, Ralf},
  title     = {STG decomposition : internal communication for SI implementability},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-037-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-40786},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {36},
  year      = {2010},
  abstract  = {STG decomposition is a promising approach to tackle the complexity problems arising in logic synthesis of speed independent circuits, a robust asynchronous (i.e. clockless) circuit type. Unfortunately, STG decomposition can result in components that in isolation have irreducible CSC conflicts. Generalising earlier work, it is shown how to resolve such conflicts by introducing internal communication between the components via structural techniques only.},
  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{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{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{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{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{Zhou2010,
  author    = {Zhou, Neng-Fa},
  title     = {What I have learned from all these solver competitions},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41431},
  year      = {2010},
  abstract  = {In this talk, I would like to share my experiences gained from participating in four CSP solver competitions and the second ASP solver competition. In particular, I'll talk about how various programming techniques can make huge differences in solving some of the benchmark problems used in the competitions. These techniques include global constraints, table constraints, and problem-specific propagators and labeling strategies for selecting variables and values. I'll present these techniques with experimental results from B-Prolog and other CLP(FD) systems.},
  language  = {en}
}
@inproceedings{HanusKoschnicke2010,
  author    = {Hanus, Michael and Koschnicke, Sven},
  title     = {An ER-based framework for declarative web programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41447},
  year      = {2010},
  abstract  = {We describe a framework to support the implementation of web-based systems to manipulate data stored in relational databases. Since the conceptual model of a relational database is often specified as an entity-relationship (ER) model, we propose to use the ER model to generate a complete implementation in the declarative programming language Curry. This implementation contains operations to create and manipulate entities of the data model, supports authentication, authorization, session handling, and the composition of individual operations to user processes. Furthermore and most important, the implementation ensures the consistency of the database w.r.t. the data dependencies specified in the ER model, i.e., updates initiated by the user cannot lead to an inconsistent state of the database. In order to generate a high-level declarative implementation that can be easily adapted to individual customer requirements, the framework exploits previous works on declarative database programming and web user interface construction in Curry.},
  language  = {en}
}