%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:41:12 +0100 GMT
%    
% Selection : Year = 1996
%




@TechReport{Avgustinova:1996,
      AUTHOR = {Avgustinova, Tania},
      TITLE = {An HPSG-Style Grammar of Bulgarian (for the Purposes of a Grammar-Checker Implementation)},
      YEAR = {1996},
      ADDRESS = {Saarbrücken},
      TYPE = {Final Deliverable Report, Project LATESLAV},
      INSTITUTION = {Universität des Saarlandes}
}

@TechReport{Avgustinova:1996_1,
      AUTHOR = {Avgustinova, Tania},
      TITLE = {Relative Clause Constructions in Bulgarian HPSG},
      YEAR = {1996},
      MONTH = {January},
      NUMBER = {71},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {An analysis of Bulgarian relative clause constructions is proposed, taking into consideration the standard HPSG theory of unbounded dependency constructions as well as the related recent research aiming at avoiding phonologically empty categories in the language description.}
}

@TechReport{Avgustinova:1996_2,
      AUTHOR = {Avgustinova, Tania},
      TITLE = {Between Lexicon and Syntax Proper},
      YEAR = {1996},
      MONTH = {September},
      NUMBER = {80},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {Bulgarian exhibits the free word order properties that are typical for all Slavic languages although it has a very impoverished system of nominal inflection. The fairly rich verbal conjugation system with complex analytic verb forms, and the well-developed mechanism of clitic replication (also referred to in the literature as pronominal reprise, clitic doubling, etc.) are specific properties of this language. This paper concentrates on structural distinguishing of two word order domains in the Bulgarian clause - the morphosyntactic one of the verb complex and the syntactic one of the verb and its modifiers within the clause. Special attention is paid to the morphosyntactic dimension.}
}

@InProceedings{Avgustinova_Oliva:1996,
      AUTHOR = {Avgustinova, Tania and Oliva, Karel},
      TITLE = {The Communicative Nature of the Wackernagel Position},
      YEAR = {1996},
      BOOKTITLE = {Prague School Linguistics Conference},
      ADDRESS = {Prague}
}

@TechReport{Avgustinova_Oliva:1996_1,
      AUTHOR = {Avgustinova, Tania and Oliva, Karel},
      TITLE = {Unbounded Dependencies in HPSG Without Traces or Lexical Rules},
      YEAR = {1996},
      MONTH = {January},
      NUMBER = {70},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {In the course of work on large-coverage HPSG grammars destinated for application in commercial grammar checkers for Bulgarian and Czech, two languages typologically different from English with respect to the word order freedom, we have developed and practically tested an alternative, efficient-implementation oriented treatment of unbounded dependencies dispensing both with gaps and with lexical rules. In this paper we shall explain the theoretical basis of the approach as well as try to prove that it is not only practically, but also theoretically superior to the current standard treatment.}
}

@InProceedings{Barry:1996,
      AUTHOR = {Barry, William J.},
      TITLE = {Some Fundamental Problems of Looking at Connected Speech},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the Symposium Sound Patterns of Connected Speech - Description, Models and Explanation, Arbeitsberichte des Instituts für Phonetik, Universität Kiel (AIPUK 31), 14-15 June},
      PAGES = {113-117},
      EDITOR = {Simpson, Adrian P. and Pätzold, Matthias},
      ADDRESS = {Kiel University}
}

@Article{Barry:1996_1,
      AUTHOR = {Barry, William J.},
      TITLE = {The Relevance of Phonetics for Pronunciation Teaching},
      YEAR = {1996},
      JOURNAL = {PHONUS},
      VOLUME = {2},
      PAGES = {5-20}
}

@Article{Benoît_et_al:1996,
      AUTHOR = {Benoît, Christian and Grice, Martine and Hazan, Valerie},
      TITLE = {The SUS Test: A Method for the Assessment of Text-to-Speech Synthesis Intelligibility Using Semantically Unpredictable Sentences},
      YEAR = {1996},
      JOURNAL = {Speech Communication},
      VOLUME = {18},
      NUMBER = {4},
      PAGES = {381-392}
}

@InProceedings{Benzmüller_Barry:1996,
      AUTHOR = {Benzmüller, Ralf and Barry, William J.},
      TITLE = {Mikrosegmentsynthese - Ökonomische Prinzipien bei der Konkatenation subphonemischer Spracheinheiten},
      YEAR = {1996},
      BOOKTITLE = {7. Konferenz Elektronische Sprachsignalverarbeitung (ESSV1996), November 25-27},
      PAGES = {86-93},
      EDITOR = {Mehnert, Dieter},
      ADDRESS = {Berlin, Germany},
      URL = {ftp://ftp.coli.uni-sb.de/pub/people/ralf/Mseg.ESSV7-96.ps.gz},
      ABSTRACT = {Es wird ein KonkatenationsSprachsynthesesystem vorgestellt, in dem das Wissen über sprachliche Kategorien ausgenutzt wird, um die Einschränkungen, die das System vorgibt, zu überwinden. Dazu werden die Konkatenationseinheiten, Mikrosegmente genannt, so häufig benutzt wie möglich. Konsonanten werden dabei in einer weitgehend kontextfreien Weise verwendet, und Vokale werden aus zwei Vokalhälften zusammengesetzt, die nach der Artikulationsstelle des folgenden bzw. vorhergehenden Konsonanten in drei Kontextkategorien eingeteilt werden. Außerdem werden quasistationäre Vokalteile an unterschiedlichen Positionen eingesetzt. Prosodische Variationen werden ausschließlich im Zeitbereich durchgeführt, um die natürliche Sprachqualität zu bewahren. Die Dauer der Mikrosegmente ist in 6 Stufen veränderbar, und deren Tonhöhe wird bei sonoranten Lauten durch Manipulationen in der offenen Phase der Stimmgebungsperiode verändert. Die entsprechenden Abschnitte der Mikrosegmente sind durch Markierungen gekennzeichnet.},
      ANNOTE = {COLIURL : Benzmuller:1996:MOP.pdf Benzmuller:1996:MOP.ps}
}

@InProceedings{Benzmüller_Barry:1996_1,
      AUTHOR = {Benzmüller, Ralf and Barry, William J.},
      TITLE = {Microsegment Synthesis - Economic Principles in a Low-Cost Solution},
      YEAR = {1996},
      BOOKTITLE = {4th International Conference on Spoken Language Processing (ICSLP '96), October 3-6},
      VOLUME = {4},
      ADDRESS = {Philadelphia, USA},
      ANNOTE = {COLIURL : Benzmuller:1996:MSE.pdf}
}

@Article{Blackburn_de Rijke:1996,
      AUTHOR = {Blackburn, Patrick and de Rijke, Maarten},
      TITLE = {Combining Logics. Special Issue},
      YEAR = {1996},
      JOURNAL = {Notre Dame Journal of Formal Logic},
      VOLUME = {37}
}

@TechReport{Blackburn_et_al:1996,
      AUTHOR = {Blackburn, Patrick and Jaspars, Jan and de Rijke, Maarten},
      TITLE = {Reasoning about Changing Information},
      YEAR = {1996},
      MONTH = {September},
      NUMBER = {81},
      PAGES = {25},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus81.ps},
      ABSTRACT = {The purpose of these notes is two-fold: (i) to give a reasonably self-contained introduction to a particular approach to theory change, known as the Alchourron-Gardenfors-Makinson (AGM) approach, and to discuss some of the alternatives and extensions that have been proposed to it over the past few years; (ii) to relate the AGM approach to other 'information-oriented' branches of logic, including intuitionistic logic, non-monotonic reasoning, verisimilitude, and modal and dynamic logic.},
      ANNOTE = {COLIURL : Blackburn:1996:RAC.pdf Blackburn:1996:RAC.ps}
}

@TechReport{Blackburn_Seligman:1996,
      AUTHOR = {Blackburn, Patrick and Seligman, Jerry},
      TITLE = {What are Hybrid Languages?},
      YEAR = {1996},
      MONTH = {November},
      NUMBER = {83},
      PAGES = {19},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {http://turing.wins.uva.nl/~carlos/hybrid/Papers/what.pdf},
      ABSTRACT = {Hybrid languages exhibit two kinds of hybridisation. First, they combine the distinguishing features of modal logic and classical logic: although they have a Kripke semantics, they also make use of explicit variables and quantifiers that bind them. Second, they don't draw a syntactic distinction between terms and formulas: terms are part of the formula algebra, thus enabling the free combination of two different types of information. The goals of this paper are to introduce a number of hybrid languages, to discuss some of their fundamental logical properties (expressivity, decidability, and undecidability), and then, brie to indicate why such systems deserve further attention. Although hybrid languages have a long and varied history, it is quite likely that most readers will know little, if anything, about them. This dictates the structure of this paper: before we can explain why we're interested in hybrid languages, we're going to have to explain what they are and give some insight into their capabilities, for only then will a discussion of broader motivational issues make much sense.},
      ANNOTE = {COLIURL : Blackburn:1996:WHL.pdf}
}

@InProceedings{Bos_et_al:1996,
      AUTHOR = {Bos, Johan and Gambäck, Björn and Lieske, Christian and Mori, Yoshiki and Pinkal, Manfred and Worm, Karsten},
      TITLE = {Compositional Semantics in Verbmobil},
      YEAR = {1996},
      BOOKTITLE = {16th International Conference on Computational Linguistics (COLING '96), August 5-9},
      VOLUME = {1},
      PAGES = {131-136},
      EDITOR = {ACL},
      ADDRESS = {Copenhagen, Denmark},
      URL = {http://lanl.arxiv.org/PS_cache/cmp-lg/pdf/9607/9607031.pdf},
      ANNOTE = {COLIURL : Bos:1996:CSV.pdf}
}

@InProceedings{Brants:1996,
      AUTHOR = {Brants, Thorsten},
      TITLE = {Better Language Models with Model Merging},
      YEAR = {1996},
      BOOKTITLE = {Conference on Empirical Methods in Natural Language Processing (EMNLP '96), May 17-18},
      ADDRESS = {Philadelphia, USA},
      ANNOTE = {COLIURL : Brants:1996:BLM.pdf}
}

@InProceedings{Brants:1996_1,
      AUTHOR = {Brants, Thorsten},
      TITLE = {Estimating Markov Model Structures},
      YEAR = {1996},
      BOOKTITLE = {4th International Conference on Spoken Language Processing (ICSLP'96), October 3-6},
      VOLUME = {2},
      PAGES = {893-896},
      EDITOR = {Bunnell, H. T. and Idsardi, W.},
      ADDRESS = {Philadelphia, USA}
}

@TechReport{Brants:1996_2,
      AUTHOR = {Brants, Thorsten},
      TITLE = {TnT - A Statistical Part-of-Speech Tagger},
      YEAR = {1996},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {Universität des Saarlandes},
      ANNOTE = {COLIURL : Brants:1996:TSP.pdf}
}

@InProceedings{Bredenkamp_et_al:1996,
      AUTHOR = {Bredenkamp, Andrew and Declerck, Thierry and Fouvry, Frederik and Music, Bradley},
      TITLE = {Efficient Integrated Tagging of Word Constructs},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9},
      PAGES = {1028-1031},
      EDITOR = {Linguistics, Association for Computational},
      ADDRESS = {Copenhagen, Denmark},
      PUBLISHER = {Morgan Kaufmann Publishers},
      ABSTRACT = {We describe a robust texthandling component, which can deal with free text in a wide range of formats and can successfully identify a wide range of phenomena, including chemical formulae, dates, numbers and proper nouns. The set of regular expressions used to capture numbers in written form (sechsundzwanzig) in German is given as an example. Proper noun candidates are identified by means of regular expressions, these being then rejected or accepted on the basis of runtime interaction with the user. This tagging component is integrated in a largescale grammar development environment, and provides direct input to the grammatical analysis component of the system by means of lift rules which convert tagged text into partial linguistic structures.},
      ANNOTE = {COLIURL : Bredenkamp:1996:EIT.pdf}
}

@InProceedings{Bretan_et_al:1996,
      AUTHOR = {Bretan, Ivan and Engstedt, Maans and Gambäck, Björn},
      TITLE = {A Multimodal Environment for Telecommunication Specifications},
      YEAR = {1996},
      BOOKTITLE = {Recent Advances in Natural Language Processing (RANLP '96). Current Issues in Linguistic Theory},
      EDITOR = {Nicolov, N. and Mitkov, R.},
      ADDRESS = {Amsterdam},
      PUBLISHER = {John Benjamins},
      URL = {http://www.sics.se/~gamback/publications/ranlpbook.ps},
      ANNOTE = {COLIURL : Bretan:1996:MET.pdf Bretan:1996:MET.ps}
}

@TechReport{Busemann:1996,
      AUTHOR = {Busemann, Stephan},
      TITLE = {Best-First Surface Realization},
      YEAR = {1996},
      NUMBER = {RR-96-05},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI},
      URL = {http://arxiv.org/PS_cache/cmp-lg/pdf/9605/9605010.pdf},
      ABSTRACT = {Current work in surface realization concentrates on the use of general, abstract algorithms that interpret large, reversible grammars. Only little attention has been paid so far to the many small and simple applications that require coverage of a small sublanguage at different degrees of sophistication. The system TG/2 described in this paper can be smoothly integrated with deep generation processes, it integrates canned text, templates, and context-free rules into a single formalism, it allows for both textual and tabular output, and it can be parameterized according to linguistic preferences. These features are based on suitably restricted production system techniques and on a generic backtracking regime.},
      ANNOTE = {COLIURL : Busemann:1996:BFSa.pdf}
}

@InProceedings{Busemann:1996_1,
      AUTHOR = {Busemann, Stephan},
      TITLE = {Best-First Surface Realization},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 8th International Natural Language Generation Workshop (INLG'96), June},
      PAGES = {101-110},
      EDITOR = {Scott, Donia},
      ADDRESS = {Sussex, UK},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tg2.ps.Z http://arxiv.org/PS_cache/cmp-lg/pdf/9605/9605010.pdf},
      ABSTRACT = {Current work in surface realization concentrates on the use of general, abstract algorithms that interpret large, reversible grammars. Only little attention has been paid so far to the many small and simple applications that require coverage of a small sublanguage at different degrees of sophistication. The system TG/2 described in this paper can be smoothly integrated with deep generation processes, it integrates canned text, templates, and context-free rules into a single formalism, it allows for both textual and tabular output, and it can be parameterized according to linguistic preferences. These features are based on suitably restricted production system techniques and on a generic backtracking regime.},
      ANNOTE = {COLIURL : Busemann:1996:BFSb.pdf Busemann:1996:BFSb.ps}
}

@InProceedings{Declerck:1996,
      AUTHOR = {Declerck, Thierry},
      TITLE = {Modeling Information-Passing within the LFG-Workbench},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 1st Annual Lexical-Functional Grammar Conference},
      ADDRESS = {Grenoble, France},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck96_lfg.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck96_lfg.ps.gz},
      ANNOTE = {COLIURL : Declerck:1996:MIP.pdf Declerck:1996:MIP.ps}
}

@InProceedings{Declerck:1996_1,
      AUTHOR = {Declerck, Thierry},
      TITLE = {Dealing with Cross-Sentential Anaphora Resolution in ALEP},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9},
      VOLUME = {1},
      PAGES = {280-285},
      ADDRESS = {Copenhagen, Danmark},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Declerck_1996_DCCSARA.pdf},
      ABSTRACT = {The experiments described here have been done in connection with the LSGRAM project, which is concerned with the development of large scale grammars and thus foreseen the coverage of real life texts''. But in order to deal with such texts, it is also necessary to process linguistic units which are larger than sentences. The resolution of crosssentential anaphora is one of the problems we have to deal with, when we switch towards the analysis of such larger linguistic units. In order to propose an analysis of the crosssentential anaphora, one has to be able to refer back to an antecedent, which is to be found in a preceding sentence. This will be done on the basis of an informationpassing framework. Using also the simple unification technique a resolution of the pronoun can then be tried out: parts of the content information of the pronoun are going to be compared (unified) with specific parts of the content information of the (possible) antecedent.},
      ANNOTE = {COLIURL : Declerck:1996:DCS.pdf}
}

@InProceedings{Declerck_et_al:1996,
      AUTHOR = {Declerck, Thierry and Schmidt, Paul and Rieder, Sibylle and Theofilidis, Axel},
      TITLE = {Lean Formalism, Linguistic Theory, and Applications. Grammar Development in ALEP},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9},
      PAGES = {286-291},
      ADDRESS = {Copenhagen, Danmark},
      URL = {http://www.iai.uni-sb.de/LS-GRAM/coling.ps.gz http://www.dfki.de/dfkibib/publications/docs/Declerck_1996_LFLTA.pdf},
      ABSTRACT = {This paper describes results achieved in a project which addresses the issue of how the gap between unificationbased grammars as a scientific concept and real world applications can be narrowed down 1 . Applicationoriented grammar development has to take into account the following parameters: Efficiency: The project chose a so called 'lean' formalism, a termencodable language providing efficient term unification, ALEP. Coverage: The project adopted a corpusbased approach. Completeness: All modules needed from text handling to semantics must be there. The paper reports on a text handling component, Two Level morphology, word structure, phrase structure, semantics and the interfaces between these components. Mainstream approach: The approach claims to be mainstream, very much indebted to HPSG, thus based on the currently most prominent and recent linguistic theory. The relation (and tension) between these parameters are described in this paper.},
      ANNOTE = {COLIURL : Declerck:1996:LFL.pdf Declerck:1996:LFL.ps}
}

@Article{Devienne_et_al:1996,
      AUTHOR = {Devienne, Philippe and Lebegue, Patrick and Parrain, Anne and Routier, Jean-Christophe and Würtz, Jörg},
      TITLE = {Smallest Horn Clause Programs},
      YEAR = {1996},
      JOURNAL = {Journal of Logic Programming},
      VOLUME = {27},
      NUMBER = {3},
      PAGES = {227-267},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/JLP96.ps.gz},
      ABSTRACT = {The simplest non-trivial program pattern in logic programming is the following one : $$left\beginarrayl p(	extitfact)leftarrow\ p(	extitleft)leftarrow p(	extitright).\ leftarrow p(	extitgoal). endarray
ight.defglobble#1gobble$$ where 	extitfact, 	extitgoal, 	extitleft and 	extitright are arbitrary terms. Because the well known 	extitappend program matches this pattern, we will denote such programs 	extitappend-like''. In spite of their simple appearance, we prove in this paper that termination and satisfiability (i.e the existence of answer-substitutions, called the 	extitemptiness problem) for are undecidable. We also study some subcases depending on the number of occurrences of variables in 	extitfact, 	extitgoal, 	extitleft or 	extitright. Moreover, we prove that the computational power of 	extitappend-like programs is equivalent to the one of Turing machines ; we show that there exists an 	extitappend-like universal program. Thus, we propose an equivalent of the Böhm-Jacopini theorem for logic programming. This result confirms the expressiveness of logic programming. The proofs are based on program transformations and encoding of problems, unpredictable iterations within number theory defined by J.H. Conway or the Post correspondence problem.},
      ANNOTE = {COLIURL : Devienne:1996:SHC.pdf Devienne:1996:SHC.ps}
}

@InProceedings{Dörre_et_al:1996,
      AUTHOR = {Dörre, Jochen and Erbach, Gregor and Manandhar, Suresh and Skut, Wojciech and Uszkoreit, Hans},
      TITLE = {A Report on the Draft EAGLES Encoding Standard for HPSG},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 3rd International Conference on HPSG and Traitement Automatique du Langage Naturel (TALN'96), May 22-24},
      PAGES = {161-168},
      ADDRESS = {Marseille, France},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-taln96.ps ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-taln96.pdf},
      ANNOTE = {COLIURL : Dorre:1996:RDE.pdf Dorre:1996:RDE.ps}
}

@InProceedings{Egg:1996,
      AUTHOR = {Egg, Markus},
      TITLE = {Aspect and Quantification: An Iterative Approach},
      YEAR = {1996},
      BOOKTITLE = {10th Amsterdam Colloquium},
      PAGES = {203-221},
      EDITOR = {Dekker, Paul and Stokhof, Martin},
      ADDRESS = {Amsterdam, The Netherlands}
}

@InProceedings{Egg:1996_1,
      AUTHOR = {Egg, Markus},
      TITLE = {Conditions on Reinterpretations of aktionsart},
      YEAR = {1996},
      BOOKTITLE = {Workshop on Recent Developments in the Theory of Natural Language Semantics},
      NUMBER = {08-95},
      EDITOR = {Kolb, J. and v. Stechow, A. and Hamm, F.},
      SERIES = {SfS-Report},
      ADDRESS = {Tübingen, Germany}
}

@InProceedings{Gardent:1996,
      AUTHOR = {Gardent, Claire},
      TITLE = {Ellipses, Pronouns and Parallelism},
      YEAR = {1996},
      BOOKTITLE = {1st International Conference on Logical Aspects of Computational Linguistics (LACL '96), April 23-25},
      ADDRESS = {Nancy, France}
}

@Article{Gardent:1996_1,
      AUTHOR = {Gardent, Claire},
      TITLE = {Anaphores parallèles et techniques de résolution},
      YEAR = {1996},
      JOURNAL = {Langages},
      VOLUME = {123},
      PAGES = {75-98}
}

@InProceedings{Gardent_Kohlhase:1996,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael},
      TITLE = {Higher-Order Coloured Unification and Natural Language Semantics},
      YEAR = {1996},
      BOOKTITLE = {34th Annual Meeting of the Association for Computational Linguistics, June 24-27},
      EDITOR = {ACL},
      ADDRESS = {Santa Cruz, California, USA}
}

@InProceedings{Gardent_Kohlhase:1996_1,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael},
      TITLE = {Focus and Higher-Order Unification},
      YEAR = {1996},
      BOOKTITLE = {16th International Conference on Computational Linguistics (COLING '96), August 5-9},
      VOLUME = {1},
      PAGES = {430-435},
      EDITOR = {ACL},
      ADDRESS = {Copenhagen, Denmark}
}

@TechReport{Gardent_Kohlhase:1996_2,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael},
      TITLE = {Focus and Higher-Order Unification},
      YEAR = {1996},
      MONTH = {April},
      NUMBER = {75},
      PAGES = {6},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus75.ps},
      ABSTRACT = {Pulman has shown that Higher-Order Unification (HOU) can be used to model the interpretation of focus. In this paper, we extend the unification-based approach to cases which are often seen as a test-bed for focus theory: utterances with multiple focus operators and second occurrence expressions. We then show that the resulting analysis favourably compares with two prominent theories of focus (namely, Rooth's Alternative Semantics and Krifka's Structured Meanings theory) in that it correctly generates interpretations which these alternative theories cannot yield. Finally, we discuss the formal properties of the approach and argue that even though HOU need not terminate, for the class of unification-problems dealt with in this paper, HOU avoids this shortcoming and is in fact computationally tractable.},
      ANNOTE = {COLIURL : Gardent:1996:FHOb.pdf Gardent:1996:FHOb.ps}
}

@TechReport{Gardent_Kohlhase:1996_3,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael},
      TITLE = {Higher-Order Coloured Unification and Natural Language Semantics},
      YEAR = {1996},
      MONTH = {April},
      NUMBER = {76},
      PAGES = {9},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus76.ps},
      ABSTRACT = {In this paper, we show that Higher--Order Coloured Unification -- a form of unification developed for automated theorem proving -- provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al. 1991)'s analysis called for.},
      ANNOTE = {COLIURL : Gardent:1996:HOCb.pdf Gardent:1996:HOCb.ps}
}

@InProceedings{Gardent_et_al:1996,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael and van Leusen, Noor},
      TITLE = {Corrections and Higher-Order Unification},
      YEAR = {1996},
      BOOKTITLE = {3. Konferenz Verarbeitung natürlicher Sprache (KONVENS '96), 7.-9. Oktober},
      PAGES = {268-279},
      ADDRESS = {Bielefeld, Germany},
      PUBLISHER = {de Gruyter},
      ABSTRACT = {We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and (in)definiteness on the other. The analysis builds on previous unification--based approaches to NL semantics and relies on Higher--Order Unification with Equivalences, a form of unification which takes into account not only syntactic beta-eta-identity but also denotational equivalence.}
}

@TechReport{Gardent_et_al:1996_1,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael and van Leusen, Noor},
      TITLE = {Corrections and Higher-Order Unification},
      YEAR = {1996},
      MONTH = {May},
      NUMBER = {77},
      PAGES = {12},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus77.ps},
      ABSTRACT = {We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and (in)definiteness on the other. The analysis builds on previous unification--based approaches to NL semantics and relies on Higher--Order Unification with Equivalences, a form of unification which takes into account not only syntactic beta-eta-identity but also denotational equivalence. Wir schlagen eine Analyse vor, die einige der Anforderungen von Korrekturen an den Kontext modelliert und sich natuerlich auf die Interaktion von Korrekturen mit Pronominalanaphern und Undefiniertheit erweitern laesst. Die Analyse basiert auf bekannten unifikationsbasierten Ansaetzen fuer die Semantik natuerlicher Sprache und benutzt eine Erweiterung der Unifikation hoeherer Stufe. Diese beruecksichtigt nicht nur strukturelle beta-eta-Gleichheit, sondern auch logische Aequivalenz.},
      ANNOTE = {COLIURL : Gardent:1996:CHOb.pdf Gardent:1996:CHOb.ps}
}

@InProceedings{Grice_et_al:1996,
      AUTHOR = {Grice, Martine and Reyelt, Matthias and Benzmüller, Ralf and Mayer, Jörg and Batliner, Anton},
      TITLE = {Consistency in Transcription and Labelling of German Intonation with GToBI},
      YEAR = {1996},
      BOOKTITLE = {4th International Conference on Spoken Language Processing (ICSLP '96), October 3-6},
      PAGES = {1716-1719},
      ADDRESS = {Philadelphia, USA}
}

@InProceedings{Heinecke_Worm:1996,
      AUTHOR = {Heinecke, Johannes and Worm, Karsten},
      TITLE = {A Lexical Semantic Database for Verbmobil},
      YEAR = {1996},
      BOOKTITLE = {4th Conference on Computational Lexicography and Text Research (COMPLEX '96), September 18-21},
      EDITOR = {Kiefer, F. and Kiss, G. and Pajzs, J.},
      ADDRESS = {Budapest, Hungary},
      ANNOTE = {COLIURL : Heinecke:1996:LSD.pdf}
}

@InProceedings{Henz:1996,
      AUTHOR = {Henz, Martin},
      TITLE = {Don't Be Puzzled!},
      YEAR = {1996},
      BOOKTITLE = {Workshop on Constraint Programming Applications: An Inventory and Taxonomy. In conjunction with the 2nd International Conference on Principles and Practice of Constraint Programming (CP '96), August 19},
      ADDRESS = {Cambridge, Massachusetts, USA},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/puzzle96.ps.gz},
      ABSTRACT = {This paper is about how to solve a class of puzzles, called self-referential quizzes (	extitsrq), with constraint programming. An 	extitsrq is a sequence of multiple choice questions that are about the puzzle itself. 	extitsrqs are an attractive pastime, when they provide the possibility of drawing non-trivial conclusions on the way to the solution. We introduce a typical 	extitsrq, and represent it as a propositional satisfiability problem. Its straightforward clausal representation is too big for effective treatment using standard methods. Instead, we solve it with finite domain constraint programming. For this application of constraint programming, support of logic connectives such as conjunction and disjunction is crucial. With their small problem descriptions, 	extitsrqs are ideal candidates for benchmarks covering the implementation of 0/1 variables in constraint programming languages.},
      ANNOTE = {COLIURL : Henz:1996:DP.pdf Henz:1996:DP.ps}
}

@InProceedings{Henz_et_al:1996,
      AUTHOR = {Henz, Martin and Lauer, Stefan and Zimmermann, Detlev},
      TITLE = {COMPOzE - Intention-Based Music Composition through Constraint Programming},
      YEAR = {1996},
      BOOKTITLE = {8th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '96), November 16-19},
      PAGES = {118-121},
      EDITOR = {Society, IEEE Computer},
      ADDRESS = {Toulouse, France},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/COMPOzE96.ps.gz},
      ABSTRACT = {The goal of this work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention-based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.},
      ANNOTE = {COLIURL : Henz:1996:CIB.pdf Henz:1996:CIB.ps}
}

@Article{Henz_Würtz:1996,
      AUTHOR = {Henz, Martin and Würtz, Jörg},
      TITLE = {Constraint-Based Time Tabling - A Case Study},
      YEAR = {1996},
      JOURNAL = {Applied Artificial Intelligence},
      VOLUME = {10},
      NUMBER = {5},
      PAGES = {439-453},
      ABSTRACT = {In this paper, we concentrate on a typical scheduling problem: the computation of a time table for a German college. Like many other scheduling problems, this problem contains a variety of complex constraints and necessitates special-purpose search strategies. Techniques from Operations Research and traditional constraint logic programming are not able to express these constraints and search strategies on a sufficiently high level of abstraction. We show that the higher-order concurrent constraint language Oz provides this high-level expressivity, and can serve as a useful programming tool for college time tabling.}
}

@InProceedings{Kasper_Krieger:1996,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich},
      TITLE = {Modularizing Codescriptive Grammars for Efficient Parsing},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9},
      PAGES = {628-633},
      EDITOR = {ACL},
      ADDRESS = {Copenhagen, Danmark},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coling96.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coling96.entry},
      ABSTRACT = {Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the levels are expressed by coreferences. Though highly attractive theoretically, using such codescriptions for analysis creates problems of efficiency. We present an approach to a modular use of codescriptions on the syntactic and semantic level. Grammatical analysis is performed by tightly coupled parsers running in tandem, each using only designated parts of the grammatical description. In the paper we describe the partitioning of grammatical information for the parsers and present results about the performance.},
      ANNOTE = {COLIURL : Kasper:1996:MCGa.pdf Kasper:1996:MCGa.ps}
}

@TechReport{Kasper_Krieger:1996_1,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich},
      TITLE = {Modularizing Codescriptive Grammars for Efficient Parsing},
      YEAR = {1996},
      NUMBER = {140},
      ADDRESS = {Saarbrücken},
      TYPE = {Verbmobil-Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coling96.ps.gz},
      ABSTRACT = {Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the levels are expressed by coreferences. Though highly attractive theoretically, using such codescriptions for analysis creates problems of efficiency. We present an approach to a modular use of codescriptions on the syntactic and semantic level. Grammatical analysis is performed by tightly coupled parsers running in tandem, each using only designated parts of the grammatical description. In the paper we describe the partitioning of grammatical information for the parsers and present results about the performance.},
      ANNOTE = {COLIURL : Kasper:1996:MCGb.pdf Kasper:1996:MCGb.ps}
}

@InProceedings{Kasper_Krieger:1996_2,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich},
      TITLE = {Integration of Prosodic and Grammatical Information in the Analysis of Dialogs},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 20th Annual German Conference on Artificial Intelligence. KI-96: Advances in Artificial Intelligence, September 17-19},
      NUMBER = {1137},
      PAGES = {163-174},
      EDITOR = {Görz, Günther and Hölldobler, Steffen},
      SERIES = {Lecture Notes in Artificial Intelligence},
      ADDRESS = {Dresden, Germany},
      PUBLISHER = {Springer Verlag},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ki96.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ki96.entry},
      ABSTRACT = {The analysis of spoken dialogs requires the analysis of complete multi-sentence turns. Especially, the segmentation of turns in sentential or phrasal segments is a problem. In this paper we present a system for turn analysis. It is based on an extension of HPSG grammar for turns and takes into account extra-linguistic prosodic information. We show how this information can be integrated and represented in the grammar, and how it is used to reduce the search space in parsing.},
      ANNOTE = {COLIURL : Kasper:1996:IPGa.pdf Kasper:1996:IPGa.ps}
}

@TechReport{Kasper_Krieger:1996_3,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich},
      TITLE = {Integration of Prosodic and Grammatical Information in the Analysis of Dialogs},
      YEAR = {1996},
      NUMBER = {141},
      ADDRESS = {Saarbrücken},
      TYPE = {Verbmobil-Report},
      INSTITUTION = {DFKI},
      URL = {http://www.dfki.de/cgi-bin/verbmobil/htbin/decode.cgi/share/VM-depot/FTP-SERVER/vm-reports/report-141-96.ps.gz},
      ABSTRACT = {The analysis of spoken dialogs requires the analysis of complete multi-sentence turns. Especially, the segmentation of turns in sentential or phrasal segments is a problem. In this paper we present a system for turn analysis. It is based on an extension of HPSG grammar for turns and takes into account extra-linguistic prosodic information. We show how this information can be integrated and represented in the grammar, and how it is used to reduce the search space in parsing.},
      ANNOTE = {COLIURL : Kasper:1996:IPGb.pdf Kasper:1996:IPGb.ps}
}

@TechReport{Kasper_et_al:1996,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich and Spilker, Jörg and Weber, Hans},
      TITLE = {From Word Hypotheses to Logical Form: An Efficient Interleaved Approach},
      YEAR = {1996},
      NUMBER = {142},
      ADDRESS = {Saarbrücken},
      TYPE = {Verbmobil-Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens96.ps.gz},
      ABSTRACT = {This paper revisits word lattice parsing whose task is to find a plausible semantic interpretation for a given utterance. Our approach of interleaved search and analysis is designed to break the frontier of toy applications. The framework is implemented in two interacting modules, running in parallel. Instead of simply parsing a word lattice, we rather do tree decoding with a probabilistic approximation of a given grammar, employing a beam search strategy. Logical form is build up in tandem according to the decoded derivation histories, using a codescriptive HPSG grammar for dialog turns. In diesem Papier betrachten wir auf neue Weise Wortgraphenparsing, dessen Aufgabe es ist, eine plausible semantische Interpretation fuer eine gegebene Aufforderung zu finden. Unser Ansatz von ueberlagerter Suche und Analyse ist mit dem Ziel entwickelt worden, die Grenzen von Spielapplikationen zu durchbrechen. Das System ist in zwei interagierenden, parallel arbeitenden Modulen implementiert. Anstatt einen Wortgraphen direkt zu parsen, dekodieren wir Baeume mit einer probabilistischen Approximation einer gegebene Grammatik unter Verwendung einer Strahlensuche. Logische Form wird gemaess den Ableitungshistorien gleichzeitig mit aufgebaut, wobei eine HPSG Grammatik fuer Dialoge eingesetzt wird.},
      ANNOTE = {COLIURL : Kasper:1996:WHLb.pdf Kasper:1996:WHLb.ps}
}

@InProceedings{Kasper_et_al:1996_1,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich and Spilker, Jörg and Weber, Hans},
      TITLE = {From Word Hypotheses to Logical Form: An Efficient Interleaved Approach},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the Natural Language Processing and Speech Technology: Results of the 3rd KONVENS Conference, October 7-9},
      PAGES = {77-88},
      EDITOR = {Gibbon, Dafydd},
      ADDRESS = {Bielefeld, Germany},
      PUBLISHER = {Mouton de Gruyter},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens96.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens96.entry},
      ABSTRACT = {This paper revisits word lattice parsing whose task is to find a plausible semantic interpretation for a given utterance. Our approach of interleaved search and analysis is designed to break the frontier of toy applications. The framework is implemented in two interacting modules, running in parallel. Instead of simply parsing a word lattice, we rather do tree decoding with a probabilistic approximation of a given grammar, employing a beam search strategy. Logical form is build up in tandem according to the decoded derivation histories, using a codescriptive HPSG grammar for dialog turns. In diesem Papier betrachten wir auf neue Weise Wortgraphenparsing, dessen Aufgabe es ist, eine plausible semantische Interpretation fuer eine gegebene Aufforderung zu finden. Unser Ansatz von ueberlagerter Suche und Analyse ist mit dem Ziel entwickelt worden, die Grenzen von Spielapplikationen zu durchbrechen. Das System ist in zwei interagierenden, parallel arbeitenden Modulen implementiert. Anstatt einen Wortgraphen direkt zu parsen, dekodieren wir Baeume mit einer probabilistischen Approximation einer gegebene Grammatik unter Verwendung einer Strahlensuche. Logische Form wird gemaess den Ableitungshistorien gleichzeitig mit aufgebaut, wobei eine HPSG Grammatik fuer Dialoge eingesetzt wird.},
      ANNOTE = {COLIURL : Kasper:1996:WHLa.pdf Kasper:1996:WHLa.ps}
}

@InProceedings{Kerber_Kohlhase:1996,
      AUTHOR = {Kerber, Manfred and Kohlhase, Michael},
      TITLE = {A Resolution Calculus for Presuppositions},
      YEAR = {1996},
      BOOKTITLE = {12th European Conference on Artificial Intelligence (ECAI '96), August 12-16},
      PAGES = {375-379},
      EDITOR = {Wahlster, Wolfgang},
      ADDRESS = {Budapest, Hungary},
      PUBLISHER = {John Wiley & Sons},
      ABSTRACT = {The semantics of everyday language and the semantics of its naive translation into classical first-order language considerably differ. An important discrepancy that is addressed in this paper is about the implicit assumption what exists. For instance, in the case of universal quantification natural language uses restrictions and presupposes that these restrictions are non-empty, while in classical logic it is only assumed that the whole universe is non-empty. On the other hand, all constants mentioned in classical logic are presupposed to exist, while it makes no problems to speak about hypothetical objects in everyday language. These problems have been discussed in philosophical logic and some adequate many-valued logics were developed to model these phenomena much better than classical first-order logic can do. An adequate calculus, however, has not yet been given. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. Unfortunately, restricted quantifications are not truth-functional, hence they do not fit the framework directly. We solve this problem by applying recent methods from sorted logics.}
}

@Article{Kerber_Kohlhase:1996_1,
      AUTHOR = {Kerber, Manfred and Kohlhase, Michael},
      TITLE = {A Tableau Calculus for Partial Functions},
      YEAR = {1996},
      JOURNAL = {Collegium logicum: Annals of the Kurt-Gödel-Society},
      VOLUME = {2},
      PAGES = {21-49}
}

@InProceedings{Kohlhase_et_al:1996,
      AUTHOR = {Kohlhase, Michael and Kuschert, Susanna and Pinkal, Manfred},
      TITLE = {A Type-Theoretic Semantics for Lambda-DRT},
      YEAR = {1996},
      BOOKTITLE = {10th Amsterdam Colloquium},
      PAGES = {479-498},
      EDITOR = {Dekker, Paul and Stokhof, Martin},
      ADDRESS = {Amsterdam, The Netherlands},
      PUBLISHER = {De Gruyter}
}

@InCollection{Konieczny_et_al:1996,
      AUTHOR = {Konieczny, Lars and Hemforth, Barbara and Scheepers, Christoph and Strube, Gerhard},
      TITLE = {Reanalysen vs. interne Reparaturen beim Sprachverstehen},
      YEAR = {1996},
      BOOKTITLE = {Perspektiven der kognitiven Linguistik: Modelle und Methoden},
      PAGES = {161-183},
      EDITOR = {Habel, Christopher and Kanngießer, Siegfried and Rickheit, Gert},
      ADDRESS = {Opladen},
      PUBLISHER = {Westdeutscher Westdeutscher Verlag}
}

@InProceedings{Konrad_et_al:1996,
      AUTHOR = {Konrad, Karsten and Maier, Holger and Milward, David and Pinkal, Manfred},
      TITLE = {An Education and Research Tool for Computational Linguistics},
      YEAR = {1996},
      BOOKTITLE = {16th International Conference on Computational Linguistics (COLING '96), August 5-9},
      VOLUME = {2},
      PAGES = {1098-1101},
      EDITOR = {ACL},
      ADDRESS = {Copenhagen, Denmark}
}

@PhdThesis{Koreman:1996,
      AUTHOR = {Koreman, Jacques},
      TITLE = {Decoding Linguistic Information in the Glottal Airflow},
      YEAR = {1996},
      ADDRESS = {Nijmegen},
      SCHOOL = {University of Nijmegen, Department of Language and Speech}
}

@MastersThesis{Kornstaedt:1996,
      AUTHOR = {Kornstaedt, Leif},
      TITLE = {Definition und Implementierung eines Front-End-Generators für Oz},
      YEAR = {1996},
      PAGES = {115},
      ADDRESS = {Kaiserslautern},
      SCHOOL = {Universität Kaiserslautern, FB Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/DA-Kornstaedt.ps.gz},
      ABSTRACT = {In der vorliegenden Diplomarbeit wird ein Front-End-Generator entwickelt, der die multiparadigmatische Sprache Oz als Zielsprache verwendet. Damit wird die Eignung von Oz als Implementierungssprache für Compiler demonstriert und die Reimplementierung des Oz-Compilers in Oz vorbereitet. Das Werkzeug ist besonders auf die Übersetzung vollkompositionaler Sprachen ausgelegt. Das bedeutet, dass neben der lexikalischen und syntaktischen Analyse, bei der über sogenannte /Produktionsschemata/ auch eigene EBNF-Operatoren definiert werden können, auch die Reduktion in eine Kernsprache von dem Werkzeug abgedeckt wird. Um letztere mächtig zu machen und die Implementierung von Baumtransformationen zu vereinfachen, bei denen keine Konflikte der Variablennamen auftreten dürfen, wird weiterhin eine automatisch durchgeführte Bindungsanalyse mit Umbenennung aller gebundenen Bezeichner von dem Werkzeug angeboten.},
      NOTE = {Kornstaedt:1996:DIF},
      ANNOTE = {COLIURL : Kornstaedt:1996:DIF.pdf Kornstaedt:1996:DIF.ps}
}

@InProceedings{Kruijff-Korbayová_Kruijff:1996,
      AUTHOR = {Korbayova, Ivana and Kruijff, Geert-Jan M.},
      TITLE = {Identification of Topic-Focus Chains},
      YEAR = {1996},
      BOOKTITLE = {Approaches to Discourse Anaphora: Proceedings of the Discourse Anaphora and Anaphora Resolution Colloquium (DAARC96), July 17-18},
      VOLUME = {8},
      PAGES = {165-179},
      EDITOR = {Botley, S. and Glass, J. and McEnery, T. and Wilson, Andrew},
      SERIES = {Technical papers},
      ADDRESS = {University Centre for Computer Corpus Research on Language, University of Lancaster, UK},
      URL = {https://www.coli.uni-saarland.de/~korbay/Publications/daarc96.ps.gz},
      ANNOTE = {COLIURL : Kruijff-Korbayova:1996:ITF.pdf Kruijff-Korbayova:1996:ITF.ps}
}

@TechReport{Kuschert:1996,
      AUTHOR = {Kuschert, Susanna},
      TITLE = {Higher Order Dynamics},
      YEAR = {1996},
      MONTH = {January},
      NUMBER = {84},
      PAGES = {41},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/~kuschert/claus.ps.gz},
      ANNOTE = {COLIURL : Kuschert:1996:HOD.pdf Kuschert:1996:HOD.ps}
}

@InProceedings{Lehmann_et_al:1996,
      AUTHOR = {Lehmann, Sabine and Estival, Dominique and Oepen, Stephan},
      TITLE = {TSNLP - Des jeux de phrases-test pour l'évaluation d'application dans le domaine du TALN},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 3rd International Conference on HPSG and Traitement Automatique du Langage Naturel (TALN'96), May 22-24},
      ADDRESS = {Marseille, France},
      URL = {http://clwww.essex.ac.uk/group/projects/tsnlp/papers/tsnlp-taln96.ps.gz},
      ABSTRACT = {Le nombre d'applications dans le domaine du TALN n'a cessé d'augmenter lors de ces dernières années. Ce développement va de pair avec une demande croissante d'outils pour évaluer ces applications. Le projet TSNLP répond à cette demande en proposant une méthodologie et des outils pour l'évaluation à l'aide de jeux de phrases-test. Mis à part une méthodologie élaborée pour la construction de matériel de test, TSNLP a créé la plus grand base de données de jeux de phrases-test actuellement disponible pour le français, l'anglais et l'allemand. En outre, ce projet a développé des outils qui facilitent la construction, le stockage et l'accès aux données. Les résultats de TSNLP seront publiques. Le projet propose ainsi des ressources linguistiques qui pourraient devenir une proposition de standard pour un modèle d'evaluation pour tout utilisateur d'applications dans le domaine du TALN.},
      ANNOTE = {COLIURL : Lehmann:1996:TJP.pdf Lehmann:1996:TJP.ps}
}

@InProceedings{Lehmann_et_al:1996_1,
      AUTHOR = {Lehmann, Sabine and Oepen, Stefan and Regnier-Prost, Sylvie and Netter, Klaus and Lux, Veronika and Klein, Judith and Falkedal, Kirsten and Fouvry, Frederik and Estival, Dominique and Dauphin, Eva and Compagnion, Hervé and Baur, Judith and Balkan, Lorna and Arnold, Doug},
      TITLE = {TSNLP - Test Suites for Natural Language Processing},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 16th International Conference on Computational Linguistics (COLING '96), August 5-9},
      PAGES = {711-716},
      ADDRESS = {Copenhagen, Danmark},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tsnlp-coling96.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tsnlp-coling96.entry},
      ANNOTE = {COLIURL : Lehmann:1996:TTS.pdf Lehmann:1996:TTS.ps}
}

@InCollection{Li:1996,
      AUTHOR = {Li, Jie},
      TITLE = {Das chinesische Schriftsystem},
      YEAR = {1996},
      BOOKTITLE = {Schrift und Schriftlichkeit : Ein interdisziplinäres Handbuch internationaler Forschung},
      VOLUME = {2},
      PAGES = {1404-1412},
      EDITOR = {Günther, Hartmut},
      ADDRESS = {Berlin},
      PUBLISHER = {Walter de Gruyter}
}

@InCollection{Millies:1996,
      AUTHOR = {Millies, Sebastian},
      TITLE = {Eine modulare Architektur für die syntaktisch-semantische Analyse},
      YEAR = {1996},
      BOOKTITLE = {Perspektiven der kognitiven Linguistik: Modelle und Methoden},
      EDITOR = {Habel, Christopher and Kanngießer, Siegfried and Rickheit, Gert},
      SERIES = {Psycholinguistische Studien},
      ADDRESS = {Opladen},
      PUBLISHER = {Westdeutscher Verlag}
}

@TechReport{Milward:1996,
      AUTHOR = {Milward, David},
      TITLE = {Integrating Situations into a Theory of Discourse Anaphora},
      YEAR = {1996},
      MONTH = {February},
      NUMBER = {74},
      PAGES = {20},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus74.ps},
      ABSTRACT = {This paper provides an account of definite and pronominal anaphora which draws together insights from dynamic semantics and situation semantics. The result is a dynamic semantics in which contexts consist of the parts of a scenario which have been brought to a hearer's attention. The contexts are structured by meta-level disjunction, corresponding to a set of situations where one is in attention but the hearer doesn't know which one, and meta-level conjunction corresponding to a set of situations which are simultaneously in attention. Data from bridging reference, disjunction, and telescoping is used to motivate the account, together with some of the data which has been used in the past to argue for and against situation based accounts of anaphora.},
      ANNOTE = {COLIURL : Milward:1996:IST.pdf Milward:1996:IST.ps}
}

@InProceedings{Mori:1996,
      AUTHOR = {Mori, Yoshiki},
      TITLE = {Multiple Discourse Relations on the Sentential Level in Japanese},
      YEAR = {1996},
      BOOKTITLE = {15th International Conference on Computational Linguistics (COLING '96), August 5-9},
      VOLUME = {2},
      PAGES = {788-793},
      EDITOR = {ACL},
      ADDRESS = {Copenhagen, Denmark}
}

@Article{Müller_Smolka:1996,
      AUTHOR = {Müller, Martin and Smolka, Gert},
      TITLE = {Oz: Nebenläufige Programmierung mit Constraints},
      YEAR = {1996},
      JOURNAL = {KI - Künstliche Intelligenz},
      VOLUME = {3},
      PAGES = {55-61},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/KI-LP96.ps.gz},
      ABSTRACT = {Dieser Artikel behandelt die Programmiersprache Oz und das ihr zugrundeliegende Programmiermodell. Oz ist eine nebenläufige Programmiersprache, die Constraintprogrammierung mit funktionaler und objektorientierter Programmierung verbindet. Oz ist als Nachfolger von Hochsprachen wie Lisp, Prolog und Smalltalk entworfen; diese Sprachen sind nur unzureichend für Anwendungen geeignet, die sowohl Problemlösungskomponenten enthalten, als auch Nebenläufigkeit und Reaktivität. Im Vergleich zu Prolog gibt Oz die Idee auf, dass Programme stets auch logische Spezifikationen sein müssen. Andererseits erlaubt Oz die flexible Programmierung von Inferenzmaschinen, deren Leistungsfähigkeit weit über das in Prolog Machbare hinausgeht. Damit steht insbesondere die Funktionalität von CLP-Sprachen wie CHIP bereit.},
      ANNOTE = {COLIURL : Muller:1996:ONP.pdf Muller:1996:ONP.ps}
}

@InProceedings{Müller_Würtz:1996,
      AUTHOR = {Müller, Tobias and Würtz, Jörg},
      TITLE = {Interfacing Propagators with a Concurrent Constraint Language},
      YEAR = {1996},
      BOOKTITLE = {Joint International Conference and Symposium on Logic Programming (JICSLP '96). Post-Conference Workshop and Compulog Net Meeting on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, September 5-6},
      PAGES = {195-206},
      ADDRESS = {Bonn, Germany},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/interfacing96.ps.gz},
      ABSTRACT = {This paper describes a C++ interface for the concurrent constraint language Oz to implement non-basic constraints as propagators. The programmer benefits from the advantages of a high-level language, like elegant and concise coding, in conjunction with efficiency. For the user it is transparent whether a constraint is implemented by an Oz procedure or through the interface. The interface is completely separated from the underlying Oz implementation. Moreover, it frees the user from tedious tasks like suspending and waking up constraints. The overall efficiency of the resulting system is comparable to existing finite domain systems. For scheduling applications we demonstrate how algorithms from Operations Research can be incorporated, which allows to obtain results comparable to commercially available systems.},
      ANNOTE = {COLIURL : Muller:1996:IPC.pdf Muller:1996:IPC.ps}
}

@Article{Muskens:1996,
      AUTHOR = {Muskens, Reinhard},
      TITLE = {Combining Montague Semantics and Discourse Representation},
      YEAR = {1996},
      JOURNAL = {Linguistics and Philosophy},
      VOLUME = {19},
      PAGES = {143-186}
}

@InCollection{Muskens_et_al:1996,
      AUTHOR = {Muskens, Reinhard and Van Benthem, Johan F. and Visser, Alber},
      TITLE = {Dynamics},
      YEAR = {1996},
      BOOKTITLE = {Handbook of Logic and Language},
      PAGES = {587-648},
      EDITOR = {Van Benthem, Johan F. and Ter Meulen, A.},
      ADDRESS = {Amsterdam},
      PUBLISHER = {Elsevier}
}

@PhdThesis{Netter:1996,
      AUTHOR = {Netter, Klaus},
      TITLE = {Functional Categories in an HPSG for German. Saarbrücken Dissertations in Computational Linguistics and Language Technology, Volume 3},
      YEAR = {1996},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Computational Linguistics}
}

@TechReport{Neumann:1996,
      AUTHOR = {Neumann, Günter},
      TITLE = {Interleaving Natural Language Parsing and Generation Through Uniform Processing},
      YEAR = {1996},
      NUMBER = {RR-96-03},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ai-uta.dvi.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ai-uta.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ai-uta.ps.gz},
      ANNOTE = {COLIURL : Neumann:1996:INL.pdf Neumann:1996:INL.ps Neumann:1996:INL.dvi}
}

@InProceedings{Niehren:1996,
      AUTHOR = {Niehren, Joachim},
      TITLE = {Functional Computation as Concurrent Computation},
      YEAR = {1996},
      BOOKTITLE = {23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '96), January 21-24},
      PAGES = {333-343},
      ADDRESS = {St. Petersburg Beach, Florida, USA},
      PUBLISHER = {ACM Press},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/POPL96.ps.gz},
      ABSTRACT = {We investigate functional computation as a special form of concurrent computation. As formal basis, we use a uniformly confluent core of the pi-calculus, which is also contained in models of higher-order concurrent constraint programming. We embed the call-by-need and the call-by-value lambda-calculus into the pi-calculus. We prove that call-by-need complexity is dominated by call-by-value complexity. In contrast to the recently proposed call-by-need lambda-calculus, our concurrent call-by-need model incorporates mutual recursion and can be extended to cyclic data structures by means of constraints.},
      NOTE = {longer version appeared as DFKI Research Report RR-95-14},
      ANNOTE = {COLIURL : Niehren:1996:FCC.pdf Niehren:1996:FCC.ps}
}

@TechReport{Oepen_et_al:1996,
      AUTHOR = {Oepen, Stefan and Fouvry, Frederik and Netter, Klaus and Fettig, Tom and Oberhauser, Fred},
      TITLE = {TSNLP User Manual. Volume 2: Core Test Suite Technology},
      YEAR = {1996},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {DFKI},
      URL = {ftp://ftp.coli.uni-sb.de/tsnlp/manual/volume2.ps.gz},
      ANNOTE = {COLIURL : Oepen:1996:TUM.pdf Oepen:1996:TUM.ps}
}

@InCollection{Pechmann_et_al:1996,
      AUTHOR = {Pechmann, Thomas and Uszkoreit, Hans and Engelkamp, Johannes and Zerbst, Dieter},
      TITLE = {Wortstellung im Deutschen Mittelfeld},
      YEAR = {1996},
      BOOKTITLE = {Perspektiven der Kognitiven Linguistik},
      PAGES = {257-299},
      EDITOR = {Habel, Christopher and Kanngießer, Siegfried and Rickheit, Gert},
      ADDRESS = {Oplaten},
      PUBLISHER = {Westdeutscher Verlag},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Pechmann_1994_WOIGMF.pdf},
      ANNOTE = {COLIURL : Pechmann:1996:WID.pdf}
}

@TechReport{Pinkal:1996,
      AUTHOR = {Pinkal, Manfred},
      TITLE = {Radical Underspecification},
      YEAR = {1996},
      MONTH = {February},
      NUMBER = {72},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes}
}

@TechReport{Pinkal:1996_1,
      AUTHOR = {Pinkal, Manfred},
      TITLE = {Constraints for Semantic Underspecification},
      YEAR = {1996},
      MONTH = {February},
      NUMBER = {73},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes}
}

@InCollection{Pinkal:1996_2,
      AUTHOR = {Pinkal, Manfred},
      TITLE = {Wie die Semantik arbeitet. Ein unterspezifiziertes Modell},
      YEAR = {1996},
      BOOKTITLE = {Wenn Die Semantik arbeitet. Klaus Baumgärtner zum 65. Geburtstag},
      PAGES = {57-88},
      EDITOR = {Harras, G. and Bierwisch, M.},
      ADDRESS = {Tübingen},
      PUBLISHER = {Max Niemeyer Verlag}
}

@TechReport{Pinkal:1996_3,
      AUTHOR = {Pinkal, Manfred},
      TITLE = {Vagueness, Ambiguity and Underspecification},
      YEAR = {1996},
      MONTH = {September},
      NUMBER = {82},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes}
}

@InProceedings{Pinkal:1996_4,
      AUTHOR = {Pinkal, Manfred},
      TITLE = {Vagueness, Ambiguity, and Underspecification},
      YEAR = {1996},
      BOOKTITLE = {Conference on Semantics and Linguistic Theory (SALT VI)},
      PAGES = {185-201},
      EDITOR = {Galloway, T. and Spence, J.},
      ADDRESS = {Rutgers University},
      PUBLISHER = {Cornell University}
}

@InCollection{Ramm_Villiger:1996,
      AUTHOR = {Ramm, Wiebke and Villiger, Claudia},
      TITLE = {Wissenschaftliche Textproduktion und Fachdomäne. Sprachliche Realisierung wissenschaftlicher Inhalte in verschiedenen Fachdisziplinen und ihre computerlinguistische Modellierung},
      YEAR = {1996},
      BOOKTITLE = {Textproduktion. HyperText, Text, KonText},
      PAGES = {205-222},
      EDITOR = {Knorr, Dagmar and Jakobs, Eva-Maria},
      SERIES = {Textproduktion und Medium, volume 5},
      ADDRESS = {Frankfurt a. M.},
      PUBLISHER = {Peter Lang}
}

@InProceedings{Reyelt_et_al:1996,
      AUTHOR = {Reyelt, Matthias and Grice, Martine and Benzmüller, Ralf and Mayer, Jörg and Batliner, Anton},
      TITLE = {Prosodische Etikettierung des Deutschen mit ToBI},
      YEAR = {1996},
      BOOKTITLE = {3. Konferenz Verarbeitung natürlicher Sprache (KONVENS '96), 7.-9. Oktober},
      PAGES = {144-155},
      EDITOR = {Gibbon, Dafydd},
      ADDRESS = {Bielefeld, Germany},
      PUBLISHER = {Mouton de Gryuter}
}

@InProceedings{Samuelsson:1996,
      AUTHOR = {Samuelsson, Christer},
      TITLE = {Handling Sparse Data by Successive Abstraction},
      YEAR = {1996},
      BOOKTITLE = {16th International Conference on Computational Linguistics (COLING '96), August 5-9},
      VOLUME = {2},
      PAGES = {895-900},
      EDITOR = {ACL},
      ADDRESS = {Copenhagen, Danmark},
      ABSTRACT = {A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed (deleted) interpolation with context-independent weights, even when the latter used a globally optimal parameter setting determined a posteriori.},
      ANNOTE = {COLIURL : Samuelsson:1996:HSDa.pdf}
}

@InProceedings{Samuelsson:1996_1,
      AUTHOR = {Samuelsson, Christer},
      TITLE = {Relating Turing's Formula and Zipf's Law},
      YEAR = {1996},
      BOOKTITLE = {4th Workshop on Very Large Corpora (WVLC-4), August 4},
      ADDRESS = {Copenhagen, Denmark}
}

@TechReport{Samuelsson:1996_2,
      AUTHOR = {Samuelsson, Christer},
      TITLE = {Relating Turing's Formula and Zipf's Law},
      YEAR = {1996},
      MONTH = {June},
      NUMBER = {78},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus78.ps},
      ABSTRACT = {A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed linear (deleted) interpolation even when the latter used a globally optimal parameter setting determined a posteriori. An asymptote is derived from Turing's local reestimation formula for population frequencies, and a local reestimation formula is derived from Zipf's law for the asymptotic behavior of population frequencies. The two are shown to be qualitatively different asymptotically, but nevertheless to be instances of a common class of reestimation-formula-asymptote pairs, in which they constitute the upper and lower bounds of the convergence region of the cumulative of the frequency function, as rank tends to infinity. The results demonstrate that Turing's formula is qualitatively different from the various extensions to Zipf's law, and suggest that it smooths the frequency estimates towards a geometric distribution.},
      ANNOTE = {COLIURL : Samuelsson:1996:RTFb.pdf Samuelsson:1996:RTFb.ps}
}

@TechReport{Samuelsson:1996_3,
      AUTHOR = {Samuelsson, Christer},
      TITLE = {Handling Sparse Data by Successive Abstraction},
      YEAR = {1996},
      MONTH = {January},
      NUMBER = {69},
      PAGES = {6},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Unversität des Saarlandes},
      ABSTRACT = {A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed linear (deleted) interpolation even when the latter used a globally optimal parameter setting determined a posteriori.},
      ANNOTE = {COLIURL : Samuelsson:1996:HSDb.pdf}
}

@InProceedings{Samuelsson_et_al:1996,
      AUTHOR = {Samuelsson, Christer and Tapanainen, Pasi and Voutalainen, Atro},
      TITLE = {Inducing Constraint Grammars},
      YEAR = {1996},
      BOOKTITLE = {3rd International Colloquium on Grammatical Inference (ICGI '96): Grammatical Inference: Learning Syntax from Sentences, September 25-27},
      NUMBER = {1147},
      PAGES = {146-155},
      EDITOR = {Miclet, L. and De La Higuera, C.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Montpellier, France},
      PUBLISHER = {Springer}
}

@TechReport{Samuelsson_et_al:1996_1,
      AUTHOR = {Samuelsson, Christer and Tapanainen, Pasi and Voutalainen, Atro},
      TITLE = {Inducing Constraint Grammars},
      YEAR = {1996},
      MONTH = {July},
      NUMBER = {79},
      PAGES = {10},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus79.ps},
      ABSTRACT = {Constraint Grammar rules are induced from corpora. A simple scheme based on local information, i.e., on lexical biases and next-neighbour contexts, extended through the use of barriers, reached 87.3 percent precision (1.12 tags/word) at 98.2 percent recall. The results compare favourably with other methods that are used for similar tasks although they are by no means as good as the results achieved using the original hand-written rules developed over several years time.},
      ANNOTE = {COLIURL : Samuelsson:1996:ICGb.pdf Samuelsson:1996:ICGb.ps}
}

@InProceedings{Schmidt_et_al:1996,
      AUTHOR = {Schmidt, Paul and Rieder, Sibylle and Theofilidis, Axel and Declerck, Thierry},
      TITLE = {Lean Formalisms, Linguistic Theory, and Applications. Grammar Development in ALEP},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9},
      ADDRESS = {Copenhagen, Danmark},
      URL = {http://www.iai.uni-sb.de/LS-GRAM/coling.ps.gz http://www.dfki.de/dfkibib/publications/docs/Declerck_1996_LFLTA.pdf},
      ABSTRACT = {This paper describes results achieved in a project which addresses the issue of how the gap between unificationbased grammars as a scientific concept and real world applications can be narrowed down 1 . Applicationoriented grammar development has to take into account the following parameters: Efficiency: The project chose a so called 'lean' formalism, a termencodable language providing efficient term unification, ALEP. Coverage: The project adopted a corpusbased approach. Completeness: All modules needed from text handling to semantics must be there. The paper reports on a text handling component, Two Level morphology, word structure, phrase structure, semantics and the interfaces between these components. Mainstream approach: The approach claims to be mainstream, very much indebted to HPSG, thus based on the currently most prominent and recent linguistic theory. The relation (and tension) between these parameters are described in this paper.},
      ANNOTE = {COLIURL : Schmidt:1996:LFL.pdf Schmidt:1996:LFL.ps}
}

@InCollection{Siegel:1996,
      AUTHOR = {Siegel, Melanie},
      TITLE = {Definiteness and Number in Japanese to German Machine Translation},
      YEAR = {1996},
      BOOKTITLE = {Natural Language Processing and Speech Technology},
      EDITOR = {Gibbon, Dafydd},
      ADDRESS = {Berlin},
      PUBLISHER = {Mouton de Gruyter},
      URL = {http://www.dfki.de/~siegel/konvens.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens.ps.Z},
      ANNOTE = {COLIURL : Siegel:1996:DNJ.pdf Siegel:1996:DNJ.ps}
}

@TechReport{Siegel:1996_1,
      AUTHOR = {Siegel, Melanie},
      TITLE = {Die japanische Syntax im Verbmobil-Forschungsprototypen},
      YEAR = {1996},
      NUMBER = {133},
      ADDRESS = {Saarbrücken},
      TYPE = {Verbmobil Report},
      INSTITUTION = {DFKI},
      URL = {http://www.dfki.de/~siegel/vm-report.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vm-report.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vm-report.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vm-report.ps.Z},
      ANNOTE = {COLIURL : Siegel:1996:JSIa.pdf Siegel:1996:JSIa.ps}
}

@InProceedings{Siegel:1996_2,
      AUTHOR = {Siegel, Melanie},
      TITLE = {Preferences and Defaults for Definiteness and Number in Japanese to German Machine Translation},
      YEAR = {1996},
      BOOKTITLE = {Selected Papers from the 11th Pacific Asia Conference on Language, Information and Computation (PACLIC 11), December 20-22},
      EDITOR = {Park, Byung-Soo and Kim, Jong-Bok},
      ADDRESS = {Kyung Hee University, Seoul},
      URL = {http://www.dfki.de/~siegel/paclic.ps.gz},
      ANNOTE = {COLIURL : Siegel:1996:PDD.pdf Siegel:1996:PDD.ps}
}

@PhdThesis{Siegel:1996_3,
      AUTHOR = {Siegel, Melanie},
      TITLE = {Die maschinelle Übersetzung aufgabenorientierter japanisch-deutscher Dialoge. Lösungen für Translation Mismatches},
      YEAR = {1996},
      URL = {http://www.dfki.de/~siegel/diss.ps.gz},
      ANNOTE = {COLIURL : Siegel:1996:MUA.pdf Siegel:1996:MUA.ps}
}

@InProceedings{Skut:1996,
      AUTHOR = {Skut, Wojciech},
      TITLE = {Adjuncts, Ambiguity, Phrase Structure and Scope},
      YEAR = {1996},
      BOOKTITLE = {3rd International Conference on HPSG. Abstracts. May 20-22},
      ADDRESS = {Marseille, France}
}

@InProceedings{Skut:1996_1,
      AUTHOR = {Skut, Wojciech},
      TITLE = {Finite Automata for Processing Word Order},
      YEAR = {1996},
      BOOKTITLE = {Workshop on Extended Finite State Models of Language (ECAI '96), August 12-16},
      ADDRESS = {Budapest, Hungary},
      PUBLISHER = {von Neumann Society of Computer Science}
}

@InProceedings{Skut_Weiß:1996,
      AUTHOR = {Skut, Wojciech and Weiß, Christian},
      TITLE = {Modelling Focus Projection with Finite State Automata},
      YEAR = {1996},
      BOOKTITLE = {3rd International Conference on HPSG and Traitement Automatique du Langage Naturel (TALN '96), May 22-24},
      ADDRESS = {Marseille, France}
}

@Article{Smolka:1996,
      AUTHOR = {Smolka, Gert},
      TITLE = {Problem Solving with Constraints and Programming},
      YEAR = {1996},
      JOURNAL = {ACM Computing Surveys},
      VOLUME = {28},
      NUMBER = {4},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ACM_Surveys_96.ps.gz},
      ABSTRACT = {I sketch a general model of constraint-based problem solving that is not committed to a particular programming paradigm, show that Prolog in particular and logic programming in general do not provide a satisfactory framework for constraint programming, and outline how constraint programming is realized in Oz, a general-purpose language for symbolic processing.},
      ANNOTE = {COLIURL : Smolka:1996:PSC.pdf Smolka:1996:PSC.ps}
}

@InCollection{Uszkoreit:1996,
      AUTHOR = {Uszkoreit, Hans},
      TITLE = {Grammatikmodelle},
      YEAR = {1996},
      BOOKTITLE = {Wörterbuch der Kognitionswissenschaft},
      EDITOR = {Strube, Gerhard},
      ADDRESS = {Stuttgart},
      PUBLISHER = {Klett-Cotta},
      NOTE = {Hauptartikel Grammatikmodelle, sowie mehrere Lang- und Kurzartikel zum Themenbereich Grammatiktheorie}
}

@TechReport{Uszkoreit_et_al:1996,
      AUTHOR = {Uszkoreit, Hans and Backofen, Rolf and Calder, Jo and Capstick, Joanne and Dini, Luca and Dörre, Jochen and Erbach, Gregor and Estival, Dominique and Manandhar, Suresh and Mineur, Anne-Marie and Oepen, Stefan},
      TITLE = {The EAGLES Formalisms Working Group - Final Report Expert Advisory Group on Language Engineering Standards},
      YEAR = {1996},
      NUMBER = {LRE 61-100},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-fwg-report.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-fwg-report.entry},
      ANNOTE = {COLIURL : Uszkoreit:1996:EFW.pdf Uszkoreit:1996:EFW.ps}
}

@InProceedings{Van Roy_et_al:1996,
      AUTHOR = {Van Roy, Peter and Mehl, Michael and Scheidhauer, Ralf},
      TITLE = {Integrating Efficient Records into Concurrent Constraint Programming},
      YEAR = {1996},
      BOOKTITLE = {8th International Symposium on Programming Languages, Implementations, Logics, and Programs (PLILP '96), September 24-27},
      NUMBER = {1140},
      PAGES = {438-453},
      EDITOR = {Kuchen, Herbert and Swierstra, S. Doaitse},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Aachen, Germany},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/plilp96.ps.gz},
      ABSTRACT = {We show how to implement efficient records in constraint logic programming (CLP) and its generalization concurrent constraint programming (CCP). Records can be naturally integrated into CCP as a new constraint domain. The implementation provides the added expressive power of concurrency and fine-grained constraints over records, yet does not pay for this expressivity when it is not used. In addition to traditional record operations, our implementation allows to compute with partially-known records. This fine granularity is useful for natural-language and knowledge-representation applications. The paper describes the implementation of records in the DFKI Oz system. Oz is a higher-order CCP language with encapsulated search. We show that the efficiency of records in CCP is competitive with modern Prolog implementation technology and that our implementation provides improved performance for natural-language applications.},
      ANNOTE = {COLIURL : Roy:1996:IER.pdf Roy:1996:IER.ps}
}

@InProceedings{Worm_Heinecke:1996,
      AUTHOR = {Worm, Karsten and Heinecke, Johannes},
      TITLE = {The Verbmobil Semantic Database},
      YEAR = {1996},
      BOOKTITLE = {Natural Language Processing and Speech Technology. Results of the 3rd KONVENS, October 7-9},
      EDITOR = {Gibbon, Dafydd},
      ADDRESS = {Bielefeld, Germany},
      PUBLISHER = {Mouton de Gruyter},
      ANNOTE = {COLIURL : Worm:1996:VSD.pdf}
}

@InProceedings{Würtz:1996,
      AUTHOR = {Würtz, Jörg},
      TITLE = {Constraint-Based Scheduling in Oz},
      YEAR = {1996},
      BOOKTITLE = {Operations Research Proceedings 1996. Selected Papers of the Symposium on Operations Research (SOR '96), September 4-6},
      PAGES = {218-223},
      EDITOR = {Zimmermann, U. and Derigs, U. and Gaul, W. and Möhrig, R. and Schuster, K.-P.},
      ADDRESS = {Technical University Braunschweig, Germany},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ConstraintScheduling97.ps.gz},
      ABSTRACT = {It is discussed, how scheduling problems can be solved in the concurrent constraint programming language Oz. Oz is the first high-level constraint language, which offers an interface to invent new constraints in an efficient way using C++. Its multi-paradigm features including programmable search are unique in the field of constraint programming. Through the interface, algorithms from Operations Research and related fields can be incorporated. The algorithms can be combined through encapsulation into constraints and can communicate via shared variables. This is exemplified by the integration of new techniques based on edge-finding for job-shop and multi-capacitated scheduling. The viability of Oz as a platform for problem solving is also exemplified by a graphical scheduling workbench. The performance for job-shop problems is comparable to state-of-the-art scheduling tools.},
      ANNOTE = {COLIURL : Wurtz:1996:CBS.pdf Wurtz:1996:CBS.ps}
}

@InProceedings{Würtz:1996_1,
      AUTHOR = {Würtz, Jörg},
      TITLE = {Oz Scheduler: A Workbench for Scheduling Problems},
      YEAR = {1996},
      BOOKTITLE = {8th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '96), November 16-19},
      PAGES = {132-139},
      ADDRESS = {Toulouse, France},
      PUBLISHER = {IEEE Computer Society Press},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/scheduler96.ps.gz},
      ABSTRACT = {This paper describes the Oz Scheduler, a workbench for scheduling problems. Through a graphical interface, the user can freely combine the elements that define a scheduling strategy. Such elements include constraints with different popagation behavior or distribution and search strategies. Exploring the possible combinations can lead to better solutions. Recent and successful techniques for scheduling are incorporated. Resulting from the selections made, a constraint problem is generated dynamically. For this problem, the solution, statistics and the search can be inspected by several graphical tools. The functionality can be extended by sending messages to the Scheduler. The functionality and the implementation of the Oz Scheduler are discussed. The overall performance of the Scheduler for standard benchmarks is comparable to state-of-the-art special-purpose systems for scheduling. The implementation is based on the concurrent constraint language Oz.},
      ANNOTE = {COLIURL : Wurtz:1996:OSW.pdf Wurtz:1996:OSW.ps}
}

@InProceedings{Würtz_Müller:1996,
      AUTHOR = {Würtz, Jörg and Müller, Tobias},
      TITLE = {Constructive Disjunction Revisited},
      YEAR = {1996},
      BOOKTITLE = {KI-96: Advances in Artificial Intelligence. 20th Annual German Conference on Artificial Intelligence, September 17-19},
      NUMBER = {1137},
      PAGES = {377-386},
      EDITOR = {Görz, Günther and Hölldobler, Steffen},
      SERIES = {Lecture Notes in Artificial Intelligence},
      ADDRESS = {Dresden, Germany},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/KI96.ps.gz},
      ABSTRACT = {Finite Domain Programming is a technique for solving combinatorial problems like planning, scheduling, configuration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where constructive disjunction provides for stronger pruning and where it fails to do so. For several problems, including a real-world college timetabling application, benefits and limitations of constructive disjunction are exemplified. As an experimental platform we use the concurrent constraint language Oz.},
      ANNOTE = {COLIURL : Wurtz:1996:CDR.pdf Wurtz:1996:CDR.ps}
}

@TechReport{Korbayova:1996,
      AUTHOR = {Korbayova, Ivana},
      TITLE = {Pronominal reference in the Plinius corpus},
      YEAR = {1996},
      NUMBER = {UT-KBS-96-06},
      TYPE = {Memoranda Informatica},
      INSTITUTION = {Twente University}
}

@Article{ter Haar_et_al:1996,
      AUTHOR = {ter Haar, Laudy and Korbayova, Ivana and van der Vet, Paul and Andernach, Toine},
      TITLE = {Using domain knowledege in resolving pronominal anaphora in plinius},
      YEAR = {1996},
      JOURNAL = {Belgian Journal of Linguistics},
      VOLUME = {10},
      PAGES = {11-35},
      NOTE = {Presented at the Conference Anaphoric Relations and (in)coherence, Antwerp, December 1--3, 1994.}
}

@Book{C2996,
      AUTHOR = {Crocker, Matthew W.},
      TITLE = {Computational Psycholinguistics: An Interdisciplinary Approach to the Study of Language},
      YEAR = {1996},
      ADDRESS = {Dordrecht},
      PUBLISHER = {Kluwer Academic Publishers}
}