When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05151.8
URN: urn:nbn:de:0030-drops-3128
Go to the corresponding Portal

Pratt-Hartmann, Ian

From TimeML to TPL

05151.PrattHartmannIan.Paper.312.pdf (0.2 MB)


This paper describes a subset of the temporal mark-up language TimeML,
and explains its relation to various formalisms found in the
literature on interval temporal logic. The subset of TimeML we
describe can be viewed as an interval temporal logic with a tractable
satisfiability problem, but very limited expressive power. Most
crucially, that logic does not permit quantification over events. The
contribution of this paper is to point out that, by choosing an
appropriate interval temporal logic, it is possible to introduce
quantification into representations of event-structure without
sacrificing decidability.

BibTeX - Entry

  author =	{Pratt-Hartmann, Ian},
  title =	{{From TimeML to TPL}},
  booktitle =	{Annotating, Extracting and Reasoning about Time and Events},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5151},
  editor =	{Graham Katz and James Pustejovsky and Frank Schilder},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-3128},
  doi =		{10.4230/DagSemProc.05151.8},
  annote =	{Keywords: Information Extraction, Interval temporal logic}

Keywords: Information Extraction, Interval temporal logic
Collection: 05151 - Annotating, Extracting and Reasoning about Time and Events
Issue Date: 2005
Date of publication: 15.11.2005

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI