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




@MastersThesis{Backofen:1989,
      AUTHOR = {Backofen, Rolf},
      TITLE = {Integration von Funktionen, Relationen und Typen beim Sprachentwurf. Teil II: Attributterme und Relationen},
      YEAR = {1989},
      ADDRESS = {Erlangen-Nürnberg},
      SCHOOL = {Friedrich-Alexander Universität}
}

@InProceedings{Backofen:1993,
      AUTHOR = {Backofen, Rolf},
      TITLE = {On the Decidability of Functional Uncertainty},
      YEAR = {1993},
      BOOKTITLE = {31st Annual Meeting of the Association for Computational Linguistics (ACL), June 22-26},
      PAGES = {201-208},
      EDITOR = {ACL},
      ADDRESS = {Ohio State University Columbus, Ohio, USA},
      PUBLISHER = {Association for Computational Linguistics},
      NOTE = {A full version has appeared as Research Report RR-93-17}
}

@InProceedings{Backofen:1993_1,
      AUTHOR = {Backofen, Rolf},
      TITLE = {Regular Path Expressions in Feature Logic},
      YEAR = {1993},
      BOOKTITLE = {5th International Conference of the Rewriting Techniques and Applications (RTA '93), June 16-18},
      NUMBER = {690},
      PAGES = {121-135},
      EDITOR = {Kirchner, C.},
      SERIES = {LNCS},
      ADDRESS = {Montreal, Canada},
      PUBLISHER = {Springer},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.dvi.Z},
      ANNOTE = {COLIURL : Backofen:1993:RPEa.pdf Backofen:1993:RPEa.ps Backofen:1993:RPEa.dvi}
}

@TechReport{Backofen:1993_2,
      AUTHOR = {Backofen, Rolf},
      TITLE = {Regular Path Expressions in Feature Logic},
      YEAR = {1993},
      NUMBER = {RR-93-17},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.dvi.Z},
      ANNOTE = {COLIURL : Backofen:1993:RPEb.pdf Backofen:1993:RPEb.ps Backofen:1993:RPEb.dvi}
}

@PhdThesis{Backofen:1994,
      AUTHOR = {Backofen, Rolf},
      TITLE = {Expressivity and Decidability of First-Order Languages over Feature Trees},
      YEAR = {1994},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Technische Fakultät},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kndisco.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kndisco.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kndisco.ps.Z},
      ANNOTE = {COLIURL : Backofen:1994:EDF.pdf Backofen:1994:EDF.ps Backofen:1994:EDF.dvi}
}

@Article{Backofen:1994_1,
      AUTHOR = {Backofen, Rolf},
      TITLE = {Regular Path Expressions in Feature Logic},
      YEAR = {1994},
      JOURNAL = {Journal of Symbolic Computation},
      VOLUME = {17},
      PAGES = {412-455},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.dvi.Z},
      ANNOTE = {COLIURL : Backofen:1994:RPE.pdf Backofen:1994:RPE.ps ackofen:1994:RPE.dvi}
}

@Article{Backofen:1995,
      AUTHOR = {Backofen, Rolf},
      TITLE = {A Complete Axiomatization of a Theory with Feature and Arity Constraints},
      YEAR = {1995},
      JOURNAL = {The Journal of Logic Programming},
      VOLUME = {24},
      PAGES = {37-72},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-35.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-35.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-35.ps.Z},
      ANNOTE = {COLIURL : Backofen:1995:CAT.pdf Backofen:1995:CAT.ps Backofen:1995:CAT.dvi}
}

@TechReport{Backofen_et_al:1994,
      AUTHOR = {Backofen, Rolf and Busemann, Stephan and Diagne, Abdel Kader and Hinkelman, Elizabeth and Kasper, Walter and Kiefer, Bernd and Krieger, Hans-Ulrich and Netter, Klaus and Neumann, Günter and Oepen, Stephan and Spackman, Stephen P. and Uszkoreit, Hans},
      TITLE = {Abschlussbericht: DISCO - Dialogsystem für autonome kooperierende Agenten},
      YEAR = {1994},
      NUMBER = {R:S95-060},
      ADDRESS = {Saarbrücken},
      TYPE = {Report},
      INSTITUTION = {DFKI},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Backofen_1994_DDFAKA.pdf},
      ABSTRACT = {In der Entwicklung der Informationstechnologie wird die natürliche Sprache zu einem unentbehrlichen Medium für die Kommunikation zwischen Menschen und ihren autonomen maschinellen Partnern (Agenten). Im Projekt DISCO wurde ein Dialogsystem entwickelt, das maschinelle Dialogpartner in die Lage versetzt, mit ihren menschlichen Partnern in natürlicher Sprache zu kommunizieren. Während existierende Dialogsysteme zur Kommunikation zwischen der Maschine und einem einzigen menschlichen Benutzer gedacht sind, nimmt das DISCO-System an Dialogen zwischen mehr als zwei Teilnehmern teil. Die autonomen kooperierenden Agenten, für die das DISCO-System geschaffen wurde, sind KISoftwaresysteme auf vernetzten Computern. DlSCO führte Forschung sowohl in Computerlinguistik als auch in anderen Gebieten der KI durch. Frühere Arbeiten an natürlichsprachlichen Dialogsystemen konzentrierten sich entweder auf moderne Methoden für die linguistische Spezifikation und die Sprachverarbeitung oder auf fortgeschrittene Dialogverarbeitung. Im Unterschied dazu konnte DISCO erfolgreich Resultate aus beiden Gebieten integrieren. Als Ergebnis erhielt das DFKI ein auf modernsten Technologien aufbauendes, umfangreiches, flexibles, erweiterbares natürlichsprachliches Kernsystem, das für eine Vielzahl von Anwendungsentwicklungen eingesetzt werden kann und bereits in mehreren anderen Projekten eingesetzt wird.},
      ANNOTE = {COLIURL : Backofen:1994:ADD.pdf}
}

@InProceedings{Backofen_et_al:1990,
      AUTHOR = {Backofen, Rolf and Euler, Lutz and Görz, Günther},
      TITLE = {Towards the Integration of Functions, Relations and Types in an AI Programming Language},
      YEAR = {1990},
      BOOKTITLE = {14th German Workshop on Artificial Intelligence (GWAI '90), September 10-14},
      VOLUME = {251},
      PAGES = {297-306},
      EDITOR = {Marburger, H.},
      SERIES = {Informatik-Fachberichte},
      ADDRESS = {Eringerfeld, Germany},
      PUBLISHER = {Springer}
}

@InProceedings{Backofen_et_al:1991,
      AUTHOR = {Backofen, Rolf and Euler, Lutz and Görz, Günther},
      TITLE = {Distributed Disjunctions for LIFE},
      YEAR = {1991},
      BOOKTITLE = {International Workshop on Processing Declarative Knowledge (PDK '91), July 1-3},
      PAGES = {161-170},
      EDITOR = {Boley, Harold and Richter, M.M.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Kaiserslautern, Germany},
      PUBLISHER = {Springer Verlag}
}

@TechReport{Backofen_et_al:1991_1,
      AUTHOR = {Backofen, Rolf and Euler, Lutz and Görz, Günther},
      TITLE = {Towards the Integration of Functions, Relations and Types in an AI Programming Language},
      YEAR = {1991},
      NUMBER = {RR-91-032},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI}
}

@TechReport{Backofen_Krieger:1993,
      AUTHOR = {Backofen, Rolf and Krieger, Hans-Ulrich},
      TITLE = {The TDL/ UDiNe System},
      YEAR = {1993},
      NUMBER = {D-93-27},
      PAGES = {67-74},
      ADDRESS = {Saarbrücken},
      TYPE = {DFKI Document},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tdl-udine.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tdl-udine.entry},
      ABSTRACT = {TDL is a typed feature-based language specifically designed to support highly lexicalized grammar theories like HPSG, FUG, or CUG. TDL offers the possibility to define (possibly recursive) types, consisting of type constraints and feature constraints over the standard connectives AND, OR, and NOT, where the types are arranged in a subsumption hierarchy. TDL distinguishes between AVM types (open-world reasoning) and SORT types (closed-world reasoning) and allows the declaration of partitions and incompatible types. Working with partially as well as with fully expanded types is possible, both at definition and at run time. TDL is incremental, i.e., it allows the redefinition of types and the use of undefined types.},
      ANNOTE = {COLIURL : Backofen:1993:TUS.pdf Backofen:1993:TUS.ps}
}

@TechReport{Backofen_et_al:1993,
      AUTHOR = {Backofen, Rolf and Krieger, Hans-Ulrich and Spackman, Stephen P. and Uszkoreit, Hans},
      TITLE = {Report of the EAGLES Workshop on Implemented Formalisms at DFKI},
      YEAR = {1993},
      NUMBER = {D-93-27},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {DFKI},
      URL = {http://www.tcs.informatik.uni-muenchen.de/ftp/backofen/publ/EAGLES-WS-Implemented93.ps.gz},
      ABSTRACT = {From the 1st through the 3rd of March 1993, the Working Group on Linguistic Formalisms of the EAGLES initiative held a workshop in Saarbrücken on implemented grammar formalisms. Starting with some notes on the Working Group, we will describe objectives, organization, and results of the workshop. We also summarize some relevant general findings as they emerged from the final discussion. The system demonstrated are described in a detailed synopsis. In order to facilitate comparison, a standardized questionnaire was used for the individual descriptions. The questionnaires were filled out by the developers. Since there might always be relevant pieces of information that do not fit well in such a questionnaire, the developers could also provide a short prose description. Most developers took advantage of this opportunity and attached a brief summary of their system.},
      ANNOTE = {COLIURL : Backofen:1993:REW.pdf Backofen:1993:REW.ps}
}

@TechReport{Backofen_et_al:1993_1,
      AUTHOR = {Backofen, Rolf and Krieger, Hans-Ulrich and Spackmann, Stephen and Uszkoreit, Hans},
      TITLE = {EAGLES Workshop on Implemented Formalisms at DFKI},
      YEAR = {1993},
      NUMBER = {D-93-27},
      ADDRESS = {Saarbrücken},
      TYPE = {DFKI Document},
      INSTITUTION = {DFKI},
      URL = {http://www.tcs.informatik.uni-muenchen.de/ftp/backofen/publ/EAGLES-WS-Implemented93.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/D-93-27.entry},
      ANNOTE = {COLIURL : Backofen:1993:EWI.pdf Backofen:1993:EWI.ps}
}

@Article{Backofen_et_al:1995,
      AUTHOR = {Backofen, Rolf and Rogers, James and Shanker, Vijay K.},
      TITLE = {A First-Order Axiomatization of the Theory of Finite Trees},
      YEAR = {1995},
      JOURNAL = {Journal of Logic, Language and Information},
      VOLUME = {4},
      NUMBER = {1},
      PAGES = {5-39},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/JOLLI95-trees.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/JOLLI95-trees.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/JOLLI95-trees.ps.Z},
      ANNOTE = {COLIURL : Backofen:1995:FOA.pdf Backofen:1995:FOA.ps Backofen:1995:FOA.dvi}
}

@TechReport{Backofen_Smolka:1992,
      AUTHOR = {Backofen, Rolf and Smolka, Gert},
      TITLE = {A Complete and Recursive Feature Theory},
      YEAR = {1992},
      NUMBER = {RR-92-30},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.ps.Z},
      ANNOTE = {COLIURL : Backofen:1992:CRF.pdf Backofen:1992:CRF.ps Backofen:1992:CRF.dvi}
}

@InProceedings{Backofen_Smolka:1993,
      AUTHOR = {Backofen, Rolf and Smolka, Gert},
      TITLE = {A Complete and Recursive Feature Theory},
      YEAR = {1993},
      BOOKTITLE = {31st Annual Meeting of the Association for Computational Linguistics (ACL), June 22-26},
      PAGES = {193-200},
      ADDRESS = {Ohio State University Columbus, Ohio, USA},
      PUBLISHER = {Association for Computational Linguistics},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.ps.Z},
      ANNOTE = {COLIURL : Backofen:1993:CRF.pdf Backofen:1993:CRF.ps Backofen:1993:CRF.dvi}
}

@Article{Backofen_Smolka:1995,
      AUTHOR = {Backofen, Rolf and Smolka, Gert},
      TITLE = {A Complete and Recursive Feature Theory},
      YEAR = {1995},
      JOURNAL = {Theoretical Computer Science},
      VOLUME = {146},
      NUMBER = {1-2},
      PAGES = {243-268},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.ps.Z},
      ANNOTE = {COLIURL : Backofen:1995:CRF.pdf Backofen:1995:CRF.ps Backofen:1995:CRF.dvi}
}

@InProceedings{Backofen_Treinen:1994,
      AUTHOR = {Backofen, Rolf and Treinen, Ralf},
      TITLE = {How to Win a Game with Features},
      YEAR = {1994},
      BOOKTITLE = {1st International Conference on Constraints in Computational Logics (CCL'94), September 7-9},
      VOLUME = {845},
      PAGES = {320-335},
      EDITOR = {Jouannaud, J.-P.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {München, Germany},
      PUBLISHER = {Springer},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/FeatureGamesCCL94.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/FeatureGamesCCL94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/FeatureGamesCCL94.ps.Z},
      ANNOTE = {COLIURL : Backofen:1994:HWG.pdf Backofen:1994:HWG.ps Backofen:1994:HWG.dvi}
}

@TechReport{Backofen_et_al:1991_2,
      AUTHOR = {Backofen, Rolf and Trost, Harald and Uszkoreit, Hans},
      TITLE = {Linking Typed Feature Formalisms and Terminological Knowledge Representation Languages in Natural Language Front-Ends},
      YEAR = {1991},
      NUMBER = {RR-91-28},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {Deutsches Forschungszentrum für Künstliche Intelligenz},
      URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1991/RR-91-28.ps.gz},
      ABSTRACT = {In this Paper wie describe an interface between typed formalisms and terminological languages like KL-ONE. The definition of such an iterface is motivated by the needs of natural language front-ends to AI-systems where information must be transmittes from the front-end to the back-end system and vice versa. We show some minor extensions to the feature formalism allow for a syntactic description of individual concepts in terms of typed feature structures. Namely, we propose to include intervals and a special kind of sets. Partial consistency checks can be made on these concepts descriptions during the unification of feature terms. Type checking on these special involves calling the classifier of the terminological language. The final consistency check is performed only when transferring these concept description into structures of the A-Box of the terminological language.},
      ANNOTE = {COLIURL : Backofen:1991:LTFa.pdf Backofen:1991:LTFa.ps}
}

@InProceedings{Backofen_et_al:1991_3,
      AUTHOR = {Backofen, Rolf and Trost, Harald and Uszkoreit, Hans},
      TITLE = {Linking Typed Feature Formalisms and Terminological Knowledge Representation Languages in Natural Language Front-Ends},
      YEAR = {1991},
      BOOKTITLE = {4th Internationaler GI-Kongress Wissenbasierte Systeme. Verteilte Künstliche Intelligenz und kooperatives Arbeiten, 23.-24. Oktober},
      PAGES = {375-383},
      EDITOR = {Brauer, W. and Hernandez, D.},
      SERIES = {Informatik-Fachberichte 291},
      ADDRESS = {München, Germany},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1991/RR-91-28.ps.gz},
      ABSTRACT = {In this Paper we describe an interface between typed formalisms and terminological languages like KL-ONE. The definition of such an iterface is motivated by the needs of natural language front-ends to AI-systems where information must be transmittes from the front-end to the back-end system and vice versa. We show some minor extensions to the feature formalism allow for a syntactic description of individual concepts in terms of typed feature structures. Namely, we propose to include intervals and a special kind of sets. Partial consistency checks can be made on these concepts descriptions during the unification of feature terms. Type checking on these special involves calling the classifier of the terminological language. The final consistency check is performed only when transferring these concept description into structures of the A-Box of the terminological language.},
      ANNOTE = {COLIURL : Backofen:1991:LTFb.pdf Backofen:1991:LTFb.ps}
}

@InProceedings{Erbach:1992,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Ambiguity and Linguistic Preferences},
      YEAR = {1992},
      BOOKTITLE = {Workshop of the 10th European Conference on Artificial Intelligence W2 (ECAI '92). Coping with Ambiguity in Typed Feature Formalisms, August 3-7},
      EDITOR = {Trost, Harald and Backofen, Rolf},
      ADDRESS = {Vienna, Austria},
      PUBLISHER = {John Wiley and Sons},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/ecai92/erbach-ecai92.pdf},
      ANNOTE = {COLIURL : Erbach:1992:ALPa.pdf}
}

@InProceedings{Neumann_et_al:1997,
      AUTHOR = {Neumann, Günter and Backofen, Rolf and Baur, Judith and Becker, Markus and Braun, Christian},
      TITLE = {An Information Extraction Core System for Real World German Text Processing},
      YEAR = {1997},
      BOOKTITLE = {Proceedings of the 5th Conference on Applied Natural Language Processing (ANLP '97), March 31 - April 3},
      PAGES = {208-215},
      EDITOR = {Jacobs, Paul},
      ADDRESS = {Washington D.C., USA},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {http://www.dfki.de/~neumann/publications/new-ps/smes-anlp97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/smes-anlp97.entry},
      ANNOTE = {COLIURL : Neumann:1997:IEC.pdf Neumann:1997:IEC.ps}
}

@InProceedings{Uszkoreit_et_al:1994,
      AUTHOR = {Uszkoreit, Hans and Backofen, Rolf and Busemann, Stephan and Diagne, Abdel Kader and Hinkelman, Elizabeth and Kasper, Walter and Kiefer, Bernd and Krieger, Hans-Ulrich and Netter, Klaus and Neumann, Günter and Oepen, Stephan and Spackman, Stephen P.},
      TITLE = {DISCO - An HPSG-Based NLP System and its Application for Appointment Scheduling},
      YEAR = {1994},
      BOOKTITLE = {Proceedings of the 15th International Conference on Computational Linguistics (COLING'94), August 5-9},
      VOLUME = {1},
      PAGES = {436-440},
      ADDRESS = {Kyoto, Japan},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coli.ps.Z ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1994/RR-94-38.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coli.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coli.entry},
      ABSTRACT = {The natural language system DISCO is described. It combines - a powerful and flexible grammar development system - linguistic competence for German including morphology, syntax and semantics - new methods for linguistic performance modelling on the basis of high-level competence grammars - new methods for modelling multi-agent dialogue competence - an interesting sample application for appointment scheduling and calendar management},
      ANNOTE = {COLIURL : Uszkoreit:1994:DHBa.pdf Uszkoreit:1994:DHBa.ps}
}

@TechReport{Uszkoreit_et_al:1994_1,
      AUTHOR = {Uszkoreit, Hans and Backofen, Rolf and Busemann, Stephan and Diagne, Abdel Kader and Hinkelman, Elizabeth and Kasper, Walter and Kiefer, Bernd and Krieger, Hans-Ulrich and Netter, Klaus and Neumann, Günter and Oepen, Stefan and Spackmann, Stephen},
      TITLE = {DISCO - An HPSG-Based NLP System and its Application for Appointment Scheduling},
      YEAR = {1994},
      NUMBER = {RR-94-38},
      ADDRESS = {Saarbrücken},
      TYPE = {Research Report},
      INSTITUTION = {DFKI},
      ABSTRACT = {The natural language system DISCO is described. It combines o a powerful and flexible grammar development system; o linguistic competence for German including morphology, syntax and semantics; o new methods for linguistic performance modelling on the basis of high-level competence grammars; o new methods for modelling multi-agent dialogue competence; o an interesting sample application for appointment scheduling and calendar management.},
      ANNOTE = {COLIURL : Uszkoreit:1994:DHBb.pdf Uszkoreit:1994:DHBb.ps}
}

@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}
}