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




@TechReport{Egg_et_al:1998_1,
      AUTHOR = {Egg, Markus and Koller, Alexander and Niehren, Joachim and Ruhrberg, Peter},
      TITLE = {Constraints over Lambda Structures, Antecedent Contained Deletion, and Quantifier Identities},
      YEAR = {1998},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {Computational Linguistics and Programming Systems Lab, University of the Saarland},
      ABSTRACT = {The constraint language for lambda-structures (CLLS) allows for a simple, integrated, and underspecified treatment of scope, ellipses, anaphora, and their interaction. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. In the case of antecedent contained deletion (ACD), the definition of parallelism in the original version of CLLS is slightly too restrictive due to an overly weak notion of quantifier identity. We show how to extend CLLS with an appropriate notion of quantifier identity such that ACD can be naturally analysed. This sheds some light on conflicting requirements on quantifier representations as needed for ACD and Hirschbühler sentences.}
}

@InProceedings{Egg_et_al:1998_2,
      AUTHOR = {Egg, Markus and Niehren, Joachim and Ruhrberg, Peter and Xu, Feiyu},
      TITLE = {Constraints over Lambda-Structures in Semantic Underspecification},
      YEAR = {1998},
      BOOKTITLE = {17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL'98), August 10-14},
      VOLUME = {1},
      PAGES = {353-359},
      EDITOR = {ACL},
      ADDRESS = {Montréal, Québec, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {http://www.dfki.de/~feiyu/CLLS-98.pdf ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/COLING-feiyu-98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/COLING-feiyu-98.entry},
      ABSTRACT = {We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A lambda-structure can be considered as a lambda-term up to consistent renaming of bound variables (alpha-equality); a constraint of CLLS is an underspecified description of a $lambda$-structure. CLLS solves a capturing problem omnipresent in underspecified scope representations. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. Based on CLLS we present a simple, integrated, and underspecified treatment of scope, parallelism, and anaphora.},
      ANNOTE = {COLIURL : Egg:1998:CLSb.pdf Egg:1998:CLSb.ps}
}

@InProceedings{Niehren_et_al:1997_1,
      AUTHOR = {Niehren, Joachim and Pinkal, Manfred and Ruhrberg, Peter},
      TITLE = {On Equality up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting},
      YEAR = {1997},
      BOOKTITLE = {14th International Conference on Automated Deduction (CADE 14), July 13-17},
      NUMBER = {1249},
      PAGES = {34-48},
      EDITOR = {McCune, W.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Townsville, Australia},
      PUBLISHER = {Springer},
      URL = {Full version available from http://www.ps.uni-sb.de/Papers/abstracts/fullContext.html},
      ABSTRACT = {We introduce equality up-to constraints over finite trees and investigate their expressiveness. Equality up-to constraints subsume equality constraints, subtree constraints, and one-step rewriting constraints. We establish a close correspondence between equality up-to constraints over finite trees and context unification. Context unification subsumes string unification and is subsumed by linear second-order unification. We obtain the following three new results. The satisfiability problem of equality up-to constraints is equivalent to context unification, which is an open problem. The positive existential fragment of the theory of one-step rewriting is decidable. The $exists^*forall^*exists^*$ fragment of the theory of context unification is undecidable.},
      ANNOTE = {COLIURL : Niehren:1997:ECF.pdf Niehren:1997:ECF.ps}
}

@InProceedings{Niehren_et_al:1997_2,
      AUTHOR = {Niehren, Joachim and Pinkal, Manfred and Ruhrberg, Peter},
      TITLE = {A Uniform Approach to Underspecification and Parallelism},
      YEAR = {1997},
      BOOKTITLE = {35th Annual Meeting of the Association of Computational Linguistics (ACL), July 7-12},
      PAGES = {410-417},
      EDITOR = {Cohen, P. R. and Wahlster, Wolfgang},
      ADDRESS = {Madrid, Spain},
      PUBLISHER = {ACL},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Ellipses.ps.gz},
      ABSTRACT = {We propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express equality and subtree relations between finite trees. In addition, our constraint language can express the equality up-to relation over trees which captures parallelism between them. The constraints are solved by context unification. We demonstrate the use of our framework at the examples of quantifier scope, ellipses, and their interaction.},
      ANNOTE = {COLIURL : Niehren:1997:UAU.pdf Niehren:1997:UAU.ps}
}