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




@TechReport{Blackburn_et_al:1998,
      AUTHOR = {Blackburn, Patrick and Bos, Johan and Kohlhase, Michael and de Nivelle, Hans},
      TITLE = {Inference and Computational Semantics},
      YEAR = {1998},
      MONTH = {November},
      NUMBER = {106},
      PAGES = {15},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus106.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus106.dvi},
      ABSTRACT = {This paper discusses inference in computational semantics. We argue that state-of-the-art methods in first-order it theorem proving/ and it model building/ are of direct relevance to inference for natural language processing. We support our claim by discussing our implementation of van der Sandt's presupposition projection algorithm in Discourse Representation Theory, an algorithm which demands sustained use of powerful inference mechanisms.},
      ANNOTE = {COLIURL : Blackburn:1998:ICS.pdf Blackburn:1998:ICS.ps Blackburn:1998:ICS.dvi}
}

@InCollection{Blackburn_et_al:2001,
      AUTHOR = {Blackburn, Patrick and Bos, Johan and Kohlhase, Michael and de Nivelle, Hans},
      TITLE = {Inference and Computational Semantics},
      YEAR = {2001},
      BOOKTITLE = {Computing Meaning},
      VOLUME = {2},
      NUMBER = {77},
      PAGES = {11-28},
      EDITOR = {Bunt, Harry and Muskens, Reinhard and Thijsse, Elias},
      SERIES = {Studies in Linguistics and Philosophie},
      ADDRESS = {Dordrecht},
      PUBLISHER = {Kluwer Academic Publishers}
}

@InProceedings{Bos:2001,
      AUTHOR = {Bos, Johan},
      TITLE = {DORIS 2001: Underspecification, Resolution and Inference for Discourse Representation Structures},
      YEAR = {2001},
      BOOKTITLE = {Proceedings of the Workshop on Inference in Compuational Semantics (ICoS-3), June 18-19},
      EDITOR = {Blackburn, Patrick and Kohlhase, Michael},
      ADDRESS = {Siena, Italy},
      URL = {https://www.coli.uni-saarland.de/~bos/doris2001.pdf},
      ANNOTE = {COLIURL : Bos:2001:DUR.pdf}
}

@Proceedings{Johan_Michael:2000,
      TITLE = {Proceedings of the Workshop on Inference in Computational Semantics (ICoS-2), International Conference and Research Center for Computer Science, July 29-30},
      YEAR = {2000},
      PAGES = {149},
      EDITOR = {Bos, Johan and Kohlhase, Michael},
      ADDRESS = {Schloss Dagstuhl},
      URL = {https://www.coli.uni-saarland.de/~bos/icos/icos2.ps.gz},
      ANNOTE = {COLIURL : Bos:2000:PWI.ps}
}

@Article{Egg_et_al:1998,
      AUTHOR = {Egg, Markus and Gardent, Claire and Kohlhase, Michael},
      TITLE = {Steuerung der Inferenz in der Diskursverarbeitung},
      YEAR = {1998},
      JOURNAL = {Kognitionswissenschaft},
      VOLUME = {7},
      PAGES = {106-110},
      ABSTRACT = {Semantic interpretation is an essential component of natural language understanding which draws on extremely efficient language-based inference techniques. Such techniques are still lacking in computational systems for natural language processing. We have investigated specialized representation formalisms and suitable inference techniques that meet some of these desiderata. We have developed higher-order inference procedures to accurately represent linguistic ambiguities in terms of underspecification, and show how these procedures can be guided by information from other linguistic strata.}
}

@InProceedings{Egg_Kohlhase:1997,
      AUTHOR = {Egg, Markus and Kohlhase, Michael},
      TITLE = {Underspecification of Quantifier Scope},
      YEAR = {1997},
      BOOKTITLE = {6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft, 08.-10. Oktober},
      ADDRESS = {Heidelberg, Germany}
}

@InProceedings{Egg_Kohlhase:1997_1,
      AUTHOR = {Egg, Markus and Kohlhase, Michael},
      TITLE = {Dynamic Control of Quantifier Scope},
      YEAR = {1997},
      BOOKTITLE = {11th Amsterdam Colloquium},
      EDITOR = {Dekker, Paul},
      ADDRESS = {Amsterdam, The Netherlands},
      PUBLISHER = {ILLC}
}

@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_Kohlhase:1997,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael},
      TITLE = {Computing Parallelism in Discourse},
      YEAR = {1997},
      BOOKTITLE = {15th International Joint Conference on Artificial Intelligence (IJCAI '97), August 23-29},
      VOLUME = {2},
      PAGES = {1016-1021},
      ADDRESS = {Nagoya, Japan},
      PUBLISHER = {Morgan Kaufmann Publishers},
      ABSTRACT = {Although much has been said about parallelism in discourse, a formal, computational theory of parallelism structure is still outstanding. In this paper, we present a theory which given two parallel utterances predicts which are the parallel elements. The theory consists of a sorted, higher-order abductive calculus and we show that it reconciles the insights of discourse theories of parallelism with those of Higher-Order Unification approaches to discourse semantics, thereby providing a natural framework in which to capture the effect of parallelism on discourse semantics.}
}

@TechReport{Gardent_et_al:1998,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael and Konrad, Karsten},
      TITLE = {Higher-Order Coloured Unification: a linguistic application},
      YEAR = {1998},
      MONTH = {November},
      NUMBER = {101},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/people/claire/tsi.ps.gz},
      ABSTRACT = {During the last decade, Higher-Order unification (HOU) has become a popular tool for constructing the semantic representation of natural language expressions. But there is a well-known problem with this approach: it over-generates that is, it produces solutions which although they are mathematically valid, are linguistically incorrect because they do not represent possible meanings of the expression being analysed. In this paper, we argue that Higher-Order Colored Unification (HOCU) can help prevent over-generation and we describe the linguistic, logical and computational aspects of an HOCU--based approach to semantic construction.},
      ANNOTE = {COLIURL : Gardent:1998:HOC.pdf Gardent:1998:HOC.ps}
}

@Article{Gardent_et_al:1999,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael and Konrad, Karsten},
      TITLE = {Higher-Order Coloured Unification: a Linguistic Application},
      YEAR = {1999},
      JOURNAL = {Technique et Science Informatiques},
      VOLUME = {18},
      NUMBER = {2},
      PAGES = {181-209}
}

@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{Hutter_Kohlhase:1997,
      AUTHOR = {Hutter, Dieter and Kohlhase, Michael},
      TITLE = {A Coloured Version of the Lambda-Calculus},
      YEAR = {1997},
      BOOKTITLE = {14th International Conference on Automated Deduction (CADE-14), July 13-17},
      NUMBER = {1249},
      PAGES = {291-305},
      EDITOR = {McCune, W.},
      SERIES = {Lecture Notes in Artificial Intelligence},
      ADDRESS = {James Cook University, Townsville, Australia},
      PUBLISHER = {Springer}
}

@Article{Hutter_Kohlhase:2000,
      AUTHOR = {Hutter, Dieter and Kohlhase, Michael},
      TITLE = {Managing Structural Information by Higher-Order Colored Unification},
      YEAR = {2000},
      JOURNAL = {Journal of Automated Reasoning},
      VOLUME = {25},
      PAGES = {123-164}
}

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

@TechReport{Kerber_Kohlhase:1997,
      AUTHOR = {Kerber, Manfred and Kohlhase, Michael},
      TITLE = {Reasoning without Believing: On the Mechanization of Presuppositions and Partiality},
      YEAR = {1997},
      MONTH = {September},
      NUMBER = {CSRP-97-23},
      ADDRESS = {Birmingham},
      TYPE = {Technical Report},
      INSTITUTION = {University of Birmingham, School of Computer Science},
      URL = {ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1997/CSRP-97-23.ps.gz},
      ABSTRACT = {It is well-known that many relevant aspects of everyday reasoning based on natural language cannot be adequately expressed in classical first-order logic. In this paper we address two of the problems, firstly that of so-called presuppositions, expressions from which it is possible to draw implicit conclusion, which classical logic normally does not warrant, and secondly the related problem of partiality and the adequate treatment of undefined expressions. In natural language, presuppositions are quite common, they can, however, only insufficiently be modeled in classical first-order logic. For instance, in the case of universal quantification one normally uses restrictions in natural language 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. Similarly, undefined expressions can be handled in natural language discourses and utterances are not only classified into the two categories 'true' and 'false'. This has led to the development of various better-suited many-valued logics. By combining different approaches we can now give a static description of presuppositions and undefinedness within the same framework. Additionally, we have developed an efficient mechanization of the induced consequence relation (which has been missing in the literature) by combining methods from many-valued truth-functional logics and sort techniques developed for search control in automated theorem proving.},
      ANNOTE = {COLIURL : Kerber:1997:RBM.pdf Kerber:1997:RBM.ps}
}

@InProceedings{Kohlhase_Koller:2000,
      AUTHOR = {Kohlhase, Michael and Koller, Alexander},
      TITLE = {Towards a Tableaux Machine for Language Understanding (ICoS '00)},
      YEAR = {2000},
      BOOKTITLE = {2nd Workshop on Inference in Computational Semantics (ICoS-2), July 30},
      ADDRESS = {Schloss Dagstuhl, Germany},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/txm.ps.gz},
      ABSTRACT = {We outline an abstract inference machine for producing discourse models in natural language understanding. This machine has tableaux as its central data structure and can operate in model generation and theorem proving modes. Search spaces are controlled by keeping track of NP saliences and equipping proof rules with costs.},
      ANNOTE = {COLIURL : Kohlhase:2000:TTM.pdf Kohlhase:2000:TTM.ps}
}

@Article{Kohlhase_Koller:2003,
      AUTHOR = {Kohlhase, Michael and Koller, Alexander},
      TITLE = {Resource-Adaptive Model Generation as a Performance Model},
      YEAR = {2003},
      JOURNAL = {Logic Journal of the IGPL},
      VOLUME = {11},
      NUMBER = {4},
      PAGES = {435--456},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/mgperf.ps.gz},
      ABSTRACT = {Model generation calculi, close relatives of tableau calculi for theorem proving, can be used as competence models for semantic natural language understanding. Unfortunately existing model generation calculi are not yet plausible as performance models of actual human processing, since they fail to capture computational aspects of human language processing. We outline an extended model generation calculus that solves the most unpleasant computational inadequacy; In the extended calculus, tableau expansion rules are equipped with costs, and model construction is a process that optimizes model quality under resource constraints with respect to these costs. We embed the new calculus into an abstract inference machine and illustrate the possibilities of this approach by presenting a partial theory of definites in this setting. In this case study, the constants in the universe are given saliences, that are maintained across the model generation process. This additional data serves as one important source of information for model quality and resource cost estimation.},
      ANNOTE = {COLIURL : Kohlhase:19xx:RAM.pdfKohlhase:19xx:RAM.ps}
}

@InProceedings{Kohlhase_Kuschert:1997,
      AUTHOR = {Kohlhase, Michael and Kuschert, Susanna},
      TITLE = {Dynamic Lambda Calculus},
      YEAR = {1997},
      BOOKTITLE = {5th Meeting on Mathematics of Language (MOL5), August 25-28},
      PAGES = {85-92},
      ADDRESS = {Schloss Dagstuhl, Germany},
      URL = {http://www.dfki.de/events/mol/papers/kuschert.ps},
      ANNOTE = {Kohlhase:1997:DLC}
}

@TechReport{Kohlhase_Kuschert:1997_1,
      AUTHOR = {Kohlhase, Michael and Kuschert, Susanna},
      TITLE = {Dynamic Lambda Calculus},
      YEAR = {1997},
      MONTH = {September},
      NUMBER = {91},
      PAGES = {29},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {http://ftp.coli.uni-sb.de/claus91.ps http://ftp.coli.uni-sb.de/claus91.dvi},
      ABSTRACT = {The goal of this paper is to lay a logical foundation for discourse theories by providing an algebraic foundation of compositional formalisms for discourse semantics as an analogon to the simply typed Lambda-calculus. Just as that can be specialized to type theory by simply providing a special type for truth values and postulating the quantifiers and connectives as constants with fixed semantics, the proposed dynamic Lambda-calculus DLC can be specialized to Lambda-DRT by essentially the same measures, yielding a much more principled and modular treatment of Lambda-DRT than before, which is also expected to provide a conceptually simple basis for studying higher-order unification for compositional discourse theories. N.B.: After printing we realised that alpha-conversion as defined here is not yet correct; we will publish an improved version soon.},
      ANNOTE = {COLIURL : Kohlhase:1997:DLCb.pdf}
}

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

@InProceedings{Kruijff-Korbayová_Webber:2000,
      AUTHOR = {Korbayova, Ivana and Webber, Bonnie},
      TITLE = {Discourse Connectives, Inference and Information Structure},
      YEAR = {2000},
      BOOKTITLE = {Workshop on Inference in Computational Semantics (ICoS-2), July 29-30},
      PAGES = {105-120},
      EDITOR = {Bos, Johan and Kohlhase, Michael},
      ADDRESS = {International Conference and Research Center for Computer Science, Schloß Dagstuhl, Germany},
      URL = {https://www.coli.uni-saarland.de/~bos/icos/kruijff.ps},
      ANNOTE = {COLIURL : Kruijff-Korbayova:2000:DCI.pdf Kruijff-Korbayova:2000:DCI.ps}
}

@InProceedings{Pinkal_Kohlhase:2000,
      AUTHOR = {Pinkal, Manfred and Kohlhase, Michael},
      TITLE = {Feature Logic for Dotted Types: A Formalism for Complex Word Meanings},
      YEAR = {2000},
      BOOKTITLE = {Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics (ACL '00), October 1-8},
      ADDRESS = {Hong Kong},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {http://www.cs.cmu.edu/~kohlhase/papers/acl00.ps},
      ABSTRACT = {In this paper we revisit Pustejovsky's proposal to treat ontologically complex word meaning by so-called dotted pairs. We use a higher-order feature logic based on Ohori's record lambda-calculus to model the semantics of words like book and library, in particular their behavior in the context of quantification and cardinality statements.},
      ANNOTE = {COLIURL : Pinkal:2000:FLD.pdf Pinkal:2000:FLD.ps}
}

@InProceedings{Striegnitz:2001,
      AUTHOR = {Striegnitz, Kristina},
      TITLE = {Model Checking for Contextual Reasoning in NLG},
      YEAR = {2001},
      BOOKTITLE = {Proceedings of Inference in Computational Semantics (ICoS-3), June 18-23},
      PAGES = {101-115},
      EDITOR = {Blackburn, Patrick and Kohlhase, Michael},
      ADDRESS = {Siena, Italy},
      URL = {https://www.coli.uni-saarland.de/cl/projects/indigen/papers/icos3.ps.gz},
      ABSTRACT = {Presupposition triggers, such as e.g. 'the', 'too', 'another', impose constraints on the context they are used in. A violation of these constraints results in an infelicitous utterance. A natural language generation system therefore has to reason on the context to check that they are satisfied. We argue that this kind of contextual reasoning is essentially a model checking task and demonstrate this for a variety of presupposition triggers. To account for the influence of some background knowledge, we propose to embed queries to a description logic knowledge base in a first order model checking algorithm.},
      ANNOTE = {COLIURL : Striegnitz:2001:MCC.pdf Striegnitz:2001:MCC.ps}
}

@InProceedings{WoGrKo2011,
      AUTHOR = {Wolska, Magdalena and Grigore, Mihai and Kohlhase, Michael},
      TITLE = {Using discourse context to interpret object-denoting mathematical expressions},
      YEAR = {2011},
      MONTH = {20-21 July},
      BOOKTITLE = {DML 2011 : Towards a Digital Mathematics Library : Bertinoro, Italy},
      PAGES = {85-101},
      ADDRESS = {Brno: Masaryk University},
      NOTE = {MP}
}