%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:22 +0100 GMT
%    
% Selection : Author: M-Andrew_Moshier
%




@InCollection{Erbach:1994_2,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Specification of Datatypes for LFG},
      YEAR = {1994},
      BOOKTITLE = {The Reusability of Grammatical Resources. Deliverable B: Specification of Datatypes},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@Article{Erbach_et_al:1994,
      AUTHOR = {Erbach, Gregor and Moshier, M. Andrew and Manandhar, Suresh and Ruessink, Herbert and van der Kraan, Mark and Thiersch, Craig},
      TITLE = {The Reusability of Grammatical Resources},
      YEAR = {1994},
      JOURNAL = {AUG News: The Newsletter of the ALEP User Group},
      VOLUME = {1},
      NUMBER = {1},
      PAGES = {8-12}
}

@TechReport{Erbach_et_al:1994_1,
      AUTHOR = {Erbach, Gregor and Moshier, M. Andrew and Manandhar, Suresh and Ruessink, Herbert and van der Kraan, Mark and Thiersch, Craig},
      TITLE = {The Reusability of Grammatical Resources},
      YEAR = {1994},
      NUMBER = {3(2)},
      PAGES = {5-7},
      ADDRESS = {Brighton, Sussex},
      TYPE = {ELSNews},
      INSTITUTION = {European Network in Language and Speech}
}

@TechReport{Erbach_et_al:1994_2,
      AUTHOR = {Erbach, Gregor and Moshier, M. Andrew and Uszkoreit, Hans},
      TITLE = {Multiple Inheritance for ALEP. ET 9.2 deliverable},
      YEAR = {1994}
}

@InCollection{Erbach_Thompson:1993,
      AUTHOR = {Erbach, Gregor and Thompson, Henry},
      TITLE = {Datatypes for LFG},
      YEAR = {1993},
      BOOKTITLE = {The Reusability of Grammatical Resources. Deliverable A: Selection of Datatypes},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig and Thompson, Henry},
      ADDRESS = {Edinburgh}
}

@Book{Erbach_et_al:1993,
      AUTHOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      TITLE = {The Reusability of Grammatical Resources. Deliverable A: Selection of Datatypes},
      YEAR = {1993},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@Book{Gregor_et_al:1994,
      TITLE = {The Reusability of Grammatical Resources. Deliverable C},
      YEAR = {1994},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@Book{Gregor_et_al:1994_1,
      TITLE = {The Reusability of Grammatical Resources. Deliverable B: Specification of Datatypes},
      YEAR = {1994},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@Book{Gregor_et_al:1995,
      TITLE = {The Reusability of Grammatical Resources. Deliverable D},
      YEAR = {1995},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@TechReport{Moshier:1993,
      AUTHOR = {Moshier, M. Andrew},
      TITLE = {On Completeness Theorems for Feature Logics},
      YEAR = {1993},
      MONTH = {April},
      NUMBER = {31},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {We formulate a sequent calculus K and prove that it is sound and complete in a strong sense with respect to a class of feature structures. The proof of completeness involves proving, first, a general characterization of the conditions under which any sequent calculus (that permits unrestricted use of Gentzen's structural rules) is strongly complete with respect to a semantical interpretation. With this general characterization, we prove completeness of the sequent calculus as well as a uniform relativization of strong completeness under appropriateness conditions. This establishes various completeness theorems from the literature as applications of the results here. To demonstrate the generality of our result, we also prove, by exactly the same technique, the completeness of an intuitionistic version of the calculus with respect to a class of Kripke structures. We next turn to a proof theoretic result that is intimately related to completeness: cut elimination. We prove a version of cut elimination for the classical calculus under appropriateness conditions, and as a corollary that various fragments of the calculus are also sound and strongly complete. Finally, completeness of the fragments allows us to investigate a correspondence between certain information systems and certain calculi. With this, we show that Pereira and Shieber's Domain of Descriptions is sound and complete, but only in a weak sense, with respect to its intended semantics.}
}

@TechReport{Moshier_Pollard:1993,
      AUTHOR = {Moshier, M. Andrew and Pollard, Carl},
      TITLE = {The Domain of Set-Valued Feature Structures},
      YEAR = {1993},
      MONTH = {November},
      NUMBER = {35},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes}
}

@InProceedings{Oliva_et_al:1999,
      AUTHOR = {Oliva, Karel and Moshier, M. Andrew and Lehmann, Sabine},
      TITLE = {Grammar Engineering for the Next Millenium},
      YEAR = {1999},
      BOOKTITLE = {Proceedings of the 5th Natural Language Processing Pacific Rim Symposium 1999 Closing the Millenium, November 5-7},
      ADDRESS = {Beijing, China},
      PUBLISHER = {Tsinghua University Press},
      URL = {http://korterm.kaist.ac.kr/nlprs99/finalpaper/528-10.rtf},
      ABSTRACT = {The prevailing current view of a (symbolic, computational) grammar is basically that of a set of rewriting rules using featurestructured categories. However, whenever such a grammar is aimed at development of a real world applied project, at least two disadvantages become clear. First, it breaks with the traditional understanding of a grammar as a network of phenomena (such as agreement, subcategorization, etc.), thus impeding the (direct) incorporation of this knowledge into such grammars. Second, a realistic grammar is inevitably huge and simultaneously contains very complex interdependencies among rules. This makes any modularization of grammar engineering (aka division of labour within a team) and above all maintaining and debugging realistic grammars a virtually impossible task. This paper presents an alternative view of formal (computational) grammars of natural language allowing for smooth modularization of the grammarwriting process and hence for meeting the pressing task of distributed grammardevelopment. The examples of both problems and their solutions are related to grammars in HPSG style, however, the problems discussed are in no way HPSG specific, just on the contrary, they indeed concern any approach making use of feature structured categories.},
      ANNOTE = {COLIURL : Oliva:1999:GEN.pdf}
}