Ontologically promiscuous flat logical forms for NLP

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review


In this paper a flat notation for logical forms is described. This notation allows the logical forms to be easy to build, easy to work with, and able to deal with ambiguity by underspecification. The main mechanism to convert a logical form into the corresponding flat form is the reification of all the predicates and operators used in an otherwise nested expression. The resulting flat logical forms are convenient for natural language processing applications that require the use of partial logical forms. In particular, it is shown how partial logical forms(encoded in flat notation) can be used to perform answer extraction.
Original languageEnglish
Title of host publicationProceedings of the Fourth International Workshop on Computational Semantics
EditorsHarry Bunt, Ielka van der Sluis, Elias Thijsse
Place of PublicationTilburg The Netherlands
PublisherTilburg University
Number of pages17
ISBN (Print)9074029167
Publication statusPublished - 2001
EventFourth International Workshop on Computational Semantics -
Duration: 10 Jan 200112 Jan 2001


WorkshopFourth International Workshop on Computational Semantics


  • flat logical form
  • reification
  • underspecifcation
  • partial logical form
  • answer extraction


Dive into the research topics of 'Ontologically promiscuous flat logical forms for NLP'. Together they form a unique fingerprint.

Cite this