Peter Ruhrberg

Learn More
We introduce equality up-to constraints over nite 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 nite trees and context uniication. Context uniication subsumes string(More)
We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A A-structure can be considered as a A-term up to consistent renaming of bound variables (a-equality); a constraint of CLLS is an underspec-ified description of a A-structure. CLLS solves a capturing problem omnipresent in(More)
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.(More)
We introduce a rst-order language for semantic underspeciication that we call Constraint Language for Lambda-Structures (CLLS). A-structure can be considered as a-term up to consistent renaming of bound variables (equality); a constraint of CLLS is an underspec-iied description of a-structure. CLLS solves a capturing problem omnipresent in underspec-iied(More)
We propose a uniied framework in which to treat semantic underspeciication and parallelism phenomena in discourse. The framework employs a constraint language that can express equality and subtree relations between nite trees. In addition, our constraint language can express the equality up-to relation over trees which captures parallelism between them. The(More)
The constraint language for lambda-structures (CLLS) allows for a simple, integrated , and underspeciied 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 deenition of parallelism in the original(More)
We introduce a rst-order language for semantic underspeciication that we call Constraint Language for Lambda-Structures (CLLS). A-structure can be considered as a-term or a logical formula up to consistent renaming of bound variables (equality); a constraint of CLLS is an underspeciied description of an-structure. CLLS solves a capturing problem omnipresent(More)
ing over Semantic Theories Alexander Guy Brockway Holt Doctor of Philosophy University of Edinburgh 1993 Abstract The topic of this thesis is abstraction over theories of formal semantics for natural language. It is motivated by the belief that a metatheoretical perspective can contribute both to a better theoretical understanding of semantic theories, and(More)
  • 1