<?xml version="1.0" standalone="yes"?>
<Paper uid="P02-1041">
  <Title>Coupling CCG and Hybrid Logic Dependency Semantics</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 Introduction
</SectionTitle>
    <Paragraph position="0"> The l-calculus has enjoyed many years as the standard semantic encoding for categorial grammars and other grammatical frameworks, but recent work has highlighted its inadequacies for both linguistic and computational concerns of representing natural language semantics (Copestake et al., 1999; Kruijff, 2001). The latter couples a resource-sensitive categorial proof theory (Moortgat, 1997) to hybrid logic (Blackburn, 2000) to formalize a dependency-based perspective on meaning, which we call here Hybrid Logic Dependency Semantics (HLDS). In this paper, we situate HLDS in the computational context by explicating its properties as a framework for computational semantics and linking it to Combinatory Categorial Grammar (CCG).</Paragraph>
    <Paragraph position="1"> The structure of the paper is as follows. In DC2, we briefly introduce CCG and how it links syntax and semantics, and then discuss semantic representations that use indexes to identify subparts of logical forms. DC3 introduces HLDS and evaluates it with respect to the criteria of other computational semantics frameworks. DC4 shows how we can build HLDS terms using CCG with unification and DC5 shows how intonation and information structure can be incorporated into the approach.</Paragraph>
  </Section>
class="xml-element"></Paper>