@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{ArtsteinPoesio2006,
  author    = {Artstein, Ron and Poesio, Massimo},
  title     = {Identifying reference to abstract objects in dialogue},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10357},
  year      = {2006},
  abstract  = {In two experiments, many annotators marked antecedents for discourse deixis as unconstrained regions of text. The experiments show that annotators do converge on the identity of these text regions, though much of what they do can be captured by a simple model. Demonstrative pronouns are more likely than definite descriptions to be marked with discourse antecedents. We suggest that our methodology is suitable for the systematic study of discourse deixis.},
  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{BarbaianiCanceddaDanceetal.2008,
  author    = {Barbaiani, Mădălina and Cancedda, Nicola and Dance, Chris and Fazekas, Szil{\´a}rd and Ga{\´a}l, Tam{\´a}s and Gaussier, {\´E}ric},
  title     = {Asymmetric term alignment with selective contiguity constraints by multi-tape automata},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27115},
  year      = {2008},
  abstract  = {This article describes a HMM-based word-alignment method that can selectively enforce a contiguity constraint. This method has a direct application in the extraction of a bilingual terminological lexicon from a parallel corpus, but can also be used as a preliminary step for the extraction of phrase pairs in a Phrase-Based Statistical Machine Translation system. Contiguous source words composing terms are aligned to contiguous target language words. The HMM is transformed into a Weighted Finite State Transducer (WFST) and contiguity constraints are enforced by specific multi-tape WFSTs. The proposed method is especially suited when basic linguistic resources (morphological analyzer, part-of-speech taggers and term extractors) are available for the source language only.},
  language  = {en}
}
@inproceedings{Barthelemy2008,
  author    = {Barth{\´e}lemy, Fran{\c{c}}ois},
  title     = {Finite-state compilation of feature structures for two-level morphology},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27120},
  year      = {2008},
  abstract  = {This paper describes a two-level formalism where feature structures are used in contextual rules. Whereas usual two-level grammars describe rational sets over symbol pairs, this new formalism uses tree structured regular expressions. They allow an explicit and precise definition of the scope of feature structures. A given surface form may be described using several feature structures. Feature unification is expressed in contextual rules using variables, like in a unification grammar. Grammars are compiled in finite state multi-tape transducers.},
  language  = {en}
}
@inproceedings{Bartle2008,
  author    = {Bartle, Richard},
  title     = {When openness closes : the line between play and design},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-24536},
  year      = {2008},
  abstract  = {One of the informal properties often used to describe a new virtual world is its degree of openness. Yet what is an "open" virtual world? Does the phrase mean generally the same thing to different people? What distinguishes an open world from a less open world? Why does openness matter anyway? The answers to these questions cast light on an important, but shadowy, and uneasy, topic for virtual worlds: the relationship between those who construct the virtual, and those who use these constructions.},
  language  = {en}
}
@inproceedings{BergmannKopp2006,
  author    = {Bergmann, Kirsten and Kopp, Stefan},
  title     = {Verbal or visual? : How information is distributed across speech and gesture in spatial dialog},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10375},
  year      = {2006},
  abstract  = {In spatial dialog like in direction giving humans make frequent use of speechaccompanying gestures. Some gestures convey largely the same information as speech while others complement speech. This paper reports a study on how speakers distribute meaning across speech and gesture, and depending on what factors. Utterance meaning and the wider dialog context were tested by statistically analyzing a corpus of direction-giving dialogs. Problems of speech production (as indicated by discourse markers and disfluencies), the communicative goals, and the information status were found to be influential, while feedback signals by the addressee do not have any influence.},
  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{BeyssadeMarandin2006,
  author    = {Beyssade, Claire and Marandin, Jean-Marie},
  title     = {From complex to simple speech acts : a bidimensional analysis of illocutionary},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10319},
  year      = {2006},
  abstract  = {We present a new analysis of illocutionary forces in dialogue. We analyze them as complex conversational moves involving two dimensions: what Speaker commits herself to and what she calls on Addressee to perform. We start from the analysis of speech acts such as confirmation requests or whimperatives, and extend the analysis to seemingly simple speech acts, such as statements and queries. Then, we show how to integrate our proposal in the framework of the Grammar for Conversation (Ginzburg, to app.), which is adequate for modelling agents' information states and how they get updated.},
  language  = {en}
}
@inproceedings{BlancConstantWatrin2008,
  author    = {Blanc, Olivier and Constant, Matthieu and Watrin, Patrick},
  title     = {Segmentation in super-chunks with a finite-state approach},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-27133},
  year      = {2008},
  abstract  = {Since Harris' parser in the late 50s, multiword units have been progressively integrated in parsers. Nevertheless, in the most part, they are still restricted to compound words, that are more stable and less numerous. Actually, language is full of semi-fixed expressions that also form basic semantic units: semi-fixed adverbial expressions (e.g. time), collocations. Like compounds, the identification of these structures limits the combinatorial complexity induced by lexical ambiguity. In this paper, we detail an experiment that largely integrates these notions in a finite-state procedure of segmentation into super-chunks, preliminary to a parser.We show that the chunker, developped for French, reaches 92.9\% precision and 98.7\% recall. Moreover, multiword units realize 36.6\% of the attachments within nominal and prepositional phrases.},
  language  = {en}
}