@book{ZZZ-Deemter:1996,
  added-at = {2007-12-14T02:49:32.000+0100},
  address = {Stanford, CA},
  biburl = {http://www.bibsonomy.org/bibtex/238e4c64257a0de9f56b28d3373158bda/diego_ma},
  booktitle = {Semantic Ambiguity and Underspecification},
  editor = {van Deemter, Kees and Peters, Stanley},
  interhash = {04ed14e26a1f636f24cc9c13dce60268},
  intrahash = {38e4c64257a0de9f56b28d3373158bda},
  keywords = {underspecification ambiguity},
  publisher = {CSLI Publications},
  timestamp = {2007-12-14T02:49:32.000+0100},
  title = {Semantic Ambiguity and Underspecification},
  year = 1996
}

@unpublished{Volk:desamb,
  added-at = {2007-12-14T02:47:40.000+0100},
  author = {Volk, Martin},
  biburl = {http://www.bibsonomy.org/bibtex/273cd853f51e41e94244aa7266ab1fb81/diego_ma},
  interhash = {0bf1ef7b4b94f56b431e09340c2f77e3},
  intrahash = {73cd853f51e41e94244aa7266ab1fb81},
  keywords = {inf_retrieval ambiguity},
  note = {Zussamenfassung Vortrag vom 19.01.1999},
  timestamp = {2007-12-14T02:47:40.000+0100},
  title = {Desambiguierung im {I}nformation {R}etrieval},
  year = 1999
}

@techreport{Sutcliffe:1994,
  added-at = {2007-12-14T02:47:11.000+0100},
  address = {Ireland},
  author = {Sutcliffe, Richard F. E. and Brehony, Tom and McElligott, Annette},
  biburl = {http://www.bibsonomy.org/bibtex/2fd3b95c5848053df40d3aafaed6ed882/diego_ma},
  institution = {Department of Computer Science and Information Systems, University of Limerick},
  interhash = {01f80b4b0412def0489289c32f80fbfe},
  intrahash = {fd3b95c5848053df40d3aafaed6ed882},
  keywords = {ambiguity link_grammar},
  number = {UL-CSIS-94-15},
  timestamp = {2007-12-14T02:47:11.000+0100},
  title = {Link Grammars and Structural Ambiguity: A Study of Technical Text},
  year = 1994
}

@article{Reyle:1993,
  added-at = {2007-12-14T02:45:42.000+0100},
  author = {Reyle, Uwe},
  biburl = {http://www.bibsonomy.org/bibtex/2e0193ae819a01e9ec8c6cd9c45456626/diego_ma},
  interhash = {38cd617f75a59dba971a8bef80e954df},
  intrahash = {e0193ae819a01e9ec8c6cd9c45456626},
  journal = {Journal of Semantics},
  keywords = {ambiguity UDRT underspecification},
  pages = {123-179},
  timestamp = {2007-12-14T02:45:42.000+0100},
  title = {Dealing with Ambiguities by Underspecification: construction, representation and deduction},
  volume = 10,
  year = 1993
}

@misc{Pratt:1999,
  added-at = {2007-12-14T02:45:17.000+0100},
  author = {Pratt-Hartmann, Ian},
  biburl = {http://www.bibsonomy.org/bibtex/24a3ed337ae5b8a373287532a4a5b1182/diego_ma},
  interhash = {4b065b8a26a89ad9a882918cbbf62dbe},
  intrahash = {4a3ed337ae5b8a373287532a4a5b1182},
  keywords = {answer_extraction ambiguity logic},
  month = {August},
  note = {Draft for internal use only},
  timestamp = {2007-12-14T02:45:17.000+0100},
  title = {Inference Problems in {ExtrAns}: Quick Summary},
  year = 1999
}

@misc{Pratt:2000,
  added-at = {2007-12-14T02:45:16.000+0100},
  author = {Pratt-Hartmann, Ian},
  biburl = {http://www.bibsonomy.org/bibtex/21f7a09551f05f96b4f1020cc2a5a01c6/diego_ma},
  interhash = {296303d550e036b6528923a5742df733},
  intrahash = {1f7a09551f05f96b4f1020cc2a5a01c6},
  keywords = {ambiguity logic},
  month = {January},
  note = {Draft},
  timestamp = {2007-12-14T02:45:16.000+0100},
  title = {An Ambiguous Logic},
  year = 2000
}

@inproceedings{Molla:Ambig,
  added-at = {2007-12-14T02:43:54.000+0100},
  address = {Paris},
  author = {Moll{\'a}, Diego and Hess, Michael},
  biburl = {http://www.bibsonomy.org/bibtex/2dddf6b8f287010ef2d619933fec8e6b4/diego_ma},
  booktitle = {Workshop on Representation and Treatment of Syntactic Ambiguity in Natural Language Processing},
  interhash = {2c7f96013c14055ea2bac021443019f8},
  intrahash = {dddf6b8f287010ef2d619933fec8e6b4},
  keywords = {ExtrAns ambiguity},
  pages = {21-24},
  publisher = {ATALA},
  timestamp = {2007-12-14T02:43:54.000+0100},
  title = {Dealing with Ambiguities in an Answer Extraction System},
  year = 2000
}

@misc{Levin:xxxx,
  added-at = {2007-12-14T02:42:19.000+0100},
  author = {Levin, Lori and Glickman, Oren and Qu, Yan and Gates, Donna and Lavie, Alon and Ros{\'e}, Carolyn P. and Ess-Dykema, Carol Van and Waibel, Alex},
  biburl = {http://www.bibsonomy.org/bibtex/244b8af076512cb5d9174b712fd67b6b6/diego_ma},
  howpublished = {Lori Levi's homepage?},
  interhash = {47ba5b74c26930ba212ce1a3927b9575},
  intrahash = {44b8af076512cb5d9174b712fd67b6b6},
  keywords = {ambiguity context machine_translation},
  timestamp = {2007-12-14T02:42:19.000+0100},
  title = {Using Context in Machine Translation of Spoken Language},
  year = {XXXX}
}

@incollection{Hirst:1992,
  added-at = {2007-12-14T02:40:27.000+0100},
  address = {Hillsdale (New Jersey), Hove and London},
  author = {Hirst, Graeme and Ryan, Mark},
  biburl = {http://www.bibsonomy.org/bibtex/2a90452cb1696d67f25aaa47ed64ebf86/diego_ma},
  booktitle = {Text-Based Intelligent Systems: Current research and practice in information extraction and retrieval},
  editor = {Jacobs, Paul S.},
  interhash = {6d788d623b2a820169d9e2acd3b36102},
  intrahash = {a90452cb1696d67f25aaa47ed64ebf86},
  keywords = {NLP ambiguity},
  pages = {59-82},
  publisher = {Lawrence Erlbaum},
  timestamp = {2007-12-14T02:40:27.000+0100},
  title = {Mixed-Depth Representations of Natural Language Text},
  url = {http://www.csri.utoronto.ca/\~{}pedmonds/cl-group/pubs/list-semantics.html},
  year = 1992
}

@article{Hirakawa:2006,
  abstract = {Preference Dependency Grammar (PDG) is a framework for the morphological, syntactic and semantic analysis of natural language sentences, PDG gives packed shared data structures for emcompassing the various ambiguities in each levels of sentence analysis with preference scores and a method for calculating the most plausible interpretation of a sentence. This paper proposes the Graph Branch Algorithm for computing the optimum deptendenc tree ( the most plausible interpretation of a sentence) from a scored dependendency forest which is a packed shated data strucutre encompassing all possible dependency trees (interpretations) of a sentence. The graph branch algorithm adopts the branch and bound principle for managing arbitrary arc co-occurrence constraints including the single valence occupation constraint which is a basic semantic constraint in PDG. This paper also reports the espeiment using English texts showing the computational complexity and behavior of the graph branch algorithm.},
  added-at = {2007-12-14T02:40:22.000+0100},
  author = {Hirakawa, Hideki},
  biburl = {http://www.bibsonomy.org/bibtex/2b9b5edb603375e5afc421e54f08c1831/diego_ma},
  interhash = {8fc541e72702fce378427119cde418dc},
  intrahash = {b9b5edb603375e5afc421e54f08c1831},
  journal = {Journal of Natural Language Processing},
  keywords = {graphs ambiguity DG},
  number = 4,
  pages = {3-31},
  timestamp = {2007-12-14T02:40:22.000+0100},
  title = {Graph Branch Algorithm: An Optimum Tree Search Method for Scored Dependency Graph with Arc Co-occurrence Constraints},
  volume = 13,
  year = 2006
}

@article{Hindle:1993,
  added-at = {2007-12-14T02:40:21.000+0100},
  author = {Hindle, Donald and Rooth, Mats},
  biburl = {http://www.bibsonomy.org/bibtex/2d2b05c731d9329b40d5e9d92ab574b29/diego_ma},
  interhash = {4c3a632ae83a0c1767b11bdfc8c39487},
  intrahash = {d2b05c731d9329b40d5e9d92ab574b29},
  journal = {Computational Linguistics},
  keywords = {ambiguity},
  number = 1,
  pages = {103-120},
  timestamp = {2007-12-14T02:40:21.000+0100},
  title = {Structural Ambiguity and Lexical Relations},
  volume = 19,
  year = 1993
}

@techreport{Gardent:2000,
  abstract = {The performance of first-order automated reasoning systems has been steadily improving, stimulated in part by the availability of test suites of mathematical problems on which the systems can be tested, tuned and compared. But discourse understanding in Natural Language poses different inference problems than mathematics. In order to tailor automated reasoning systems to the needs of Natural Language understanding, similar test suites need to be developed. In this paper, we claim that several kinds of ambiguity in discourse can be resolved through automated reasoning checks for consistency, informativity, and minimality. Future test suites should therefore include problems of these sorts. The overall goal then is to characterise the range of inference problems that discourse understanding gives rise to and that test suites should include.},
  added-at = {2007-12-14T02:39:14.000+0100},
  author = {Gardent, Claire and Webber, Bonnie},
  biburl = {http://www.bibsonomy.org/bibtex/200235e82cf2dfe48c19c18ccdf1d6df2/diego_ma},
  institution = {CoLi Saarbr{{\"u}}cken},
  interhash = {2f598a4dbfc3fb763fbdeba256539977},
  intrahash = {00235e82cf2dfe48c19c18ccdf1d6df2},
  keywords = {logic ambiguity},
  month = {February},
  number = {CLAUS-113},
  timestamp = {2007-12-14T02:39:14.000+0100},
  title = {Automated Reasoning and Discourse Disambiguation},
  url = {http://www.coli.uni-sb.de/cl/claus/},
  year = 2000
}

@book{Franz:1996:2,
  added-at = {2007-12-14T02:38:59.000+0100},
  address = {Berlin},
  author = {Franz, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/2e4a8e981a30ebf44ce55764766f403bc/diego_ma},
  interhash = {56bc19fa098f738211ef4b26a6505fb4},
  intrahash = {e4a8e981a30ebf44ce55764766f403bc},
  keywords = {ambiguity},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  timestamp = {2007-12-14T02:38:59.000+0100},
  title = {Automatic Ambiguity Resolution in Natural Language Processing},
  volume = 1171,
  year = 1996
}

@techreport{Eijck:1996,
  abstract = {In this paper, reasoning with ambiguous representations is explored in a formal way, with ambiguities at the level of propositions in propositional logic and predicate logic, and ambiguous representations of scopings in predicate logic as the main examples. First a version of propositional logic with propositional ambiguities is presented and a sequent axiomatization for it is given. This is then extended to predicate logic. Next, predicate logic with scope ambiguites is introduced and discussed, and again a sequent calculus for it is proposed. The conclusion connects the results to natural language semantics, and briefly compares them with existing logics of ambiguity. An appendix gives completeness proofs for our versions of ambiguous propositional and predicate logic.},
  added-at = {2007-12-14T02:38:31.000+0100},
  author = {van Eijck, Jan and Jaspars, Jan},
  biburl = {http://www.bibsonomy.org/bibtex/232445c2b6bab858839ca0569c720e422/diego_ma},
  institution = {Computer Science, CWI},
  interhash = {7fb0fb3a3f299ddeba4ba8a58523e89b},
  intrahash = {32445c2b6bab858839ca0569c720e422},
  keywords = {ambiguity},
  number = {CS-R9616},
  timestamp = {2007-12-14T02:38:31.000+0100},
  title = {Ambiguity and Reasoning},
  url = {http://www.cwi.nl/static/publications/reports/abs/CS-R9616.html},
  year = 1996
}

@inproceedings{Bear:1988,
  added-at = {2007-12-14T02:35:53.000+0100},
  address = {Austin, TX},
  author = {Bear, John and Hobbs, Jerry R.},
  biburl = {http://www.bibsonomy.org/bibtex/2f078b861afae27f266694303f02a069b/diego_ma},
  booktitle = {Proceedings of the 2nd Conference on Applied Natural Language Processing},
  interhash = {aa4d1b99d2db701fd6e56104318ce6cb},
  intrahash = {f078b861afae27f266694303f02a069b},
  keywords = {ambiguity},
  pages = {235-242},
  timestamp = {2007-12-14T02:35:53.000+0100},
  title = {Localizing Expression of Ambiguity},
  year = 1988
}

@article{Alshawi:1994,
  added-at = {2007-12-14T02:35:22.000+0100},
  author = {Alshawi, Hiyan},
  biburl = {http://www.bibsonomy.org/bibtex/2da8cedc27f41592099526ad86d63b9e7/diego_ma},
  interhash = {dbeabee5965ff8f2c0f0939c5551d5d5},
  intrahash = {da8cedc27f41592099526ad86d63b9e7},
  journal = {Computational Linguistics},
  keywords = {ambiguity},
  note = {Available also at \myurl{http://www.cam.sri.com/tr/crc041/paper.ps.Z}},
  number = 4,
  pages = {635-648},
  timestamp = {2007-12-14T02:35:22.000+0100},
  title = {Training and Scaling Preference Functions for Disambiguation},
  volume = 20,
  year = 1994
}