Constraint Logic Programming for Resolution of Relative Time Expressions

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

Abstract

Translating time expression into absolute time points or durations is a challenge for natural languages processing such as text mining and text understanding in general. We present a constraint logic language CLP(Time) tailored to text usages concerned with time and calendar. It provides a simple and flexible formalism to express relationships between different time expressions in a text, thereby giving a recipe for resolving them into absolute time. A constraint solver is developed which, as opposed to some earlier approaches, is independent of the order in which temporal information is introduced, and it can give meaningful output also when no exact reference time is available.
OriginalsprogEngelsk
TitelLanguage, Life, Limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014
RedaktørerArnold Beckman, Erzsébet Csuhaj-Varjú, Klaus Meer
ForlagSpringer VS
Publikationsdato2014
Sider93-102
ISBN (Trykt)978-3-319-08018-5
DOI
StatusUdgivet - 2014
NavnLecture Notes in Computer Science
Vol/bind8493
ISSN0302-9743

Citer dette

Christiansen, H. (2014). Constraint Logic Programming for Resolution of Relative Time Expressions. I A. Beckman, E. Csuhaj-Varjú, & K. Meer (red.), Language, Life, Limits: 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014 (s. 93-102). Springer VS. Lecture Notes in Computer Science, Bind. 8493 https://doi.org/10.1007/978-3-319-08019-2_10