Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
In Pursuit of Decidable 'Logical Form'
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0001-7088-3070
2014 (English)Conference paper, Poster (with or without abstract) (Refereed)
Abstract [en]

Natural language interfaces commonly map to some type of logical form that represents the meaning of the user’s utterance. It is rare however, that this logical form is bona fide logic (e.g. expressions that may be tested for satisfiability, etc.). We explore an approach that limits logical form to decidable logics and exploits this property by deeply integrating theorm proving into analysis, pragmatics, reasoning and generation. We explore this in the context of providing natural language interfaces to databases. While support for queries beyond first-order is a requirement (e.g. queries computing average values), we isolate these non-first-order constructs via markers, flagging sub-expressions for special treatment within the non-linguistic reasoning component. We shall demonstrate our approach and its merits at SLTC and report on several threads of ongoing work to extend our approach.

Place, publisher, year, edition, pages
2014.
Series
The Fifth Swedish Language Technology Conference
National Category
Language Technology (Computational Linguistics)
Identifiers
URN: urn:nbn:se:kth:diva-165380OAI: oai:DiVA.org:kth-165380DiVA: diva2:808208
Conference
The Fifth Swedish Language Technology Conference (SLTC 2014)
Note

QC 20150429

Available from: 2015-04-27 Created: 2015-04-27 Last updated: 2015-04-29Bibliographically approved

Open Access in DiVA

fulltext(113 kB)