Constraint Logic Programming for Resolution of Relative Time Expressions

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


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.
Original languageEnglish
Title of host publicationLanguage, Life, Limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014
EditorsArnold Beckman, Erzsébet Csuhaj-Varjú, Klaus Meer
PublisherSpringer VS
Publication date2014
ISBN (Print)978-3-319-08018-5
Publication statusPublished - 2014
SeriesLecture Notes in Computer Science

Cite this