<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-2065">
  <Title>AN IMPLEMENTATION OF FORMAL SEMANTICS IN THE FORMALISM OF RELATIONAL DATABASES.</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
ABSTRACT
</SectionTitle>
    <Paragraph position="0"> This paper presents an implementation of formal semantics as described in Keenan and Fa!tz's Boolean Semantics for Natural Langt~age \[4\]. The main characteristic of this implementation is that it avoids the intermediate step of translating NL into a formal language, such as an extended version of predicate calculus. My choice of not using any intermediate language, which Montague already suggested in Universal Grammar \[5\], makes my implementation free of the problems related to the syntax of such a language like binding the variables and resolving scope ambiguities.</Paragraph>
    <Paragraph position="1"> On the other hand, not translating NL into an intermediate language requires every denotation (i.e. semantic value) to be explicitly and accurately represented in a database.</Paragraph>
  </Section>
class="xml-element"></Paper>