From TimeML to TPL

Author Ian Pratt-Hartmann



PDF
Thumbnail PDF

File

DagSemProc.05151.8.pdf
  • Filesize: 199 kB
  • 11 pages

Document Identifiers

Author Details

Ian Pratt-Hartmann

Cite AsGet BibTex

Ian Pratt-Hartmann. From TimeML to TPL. In Annotating, Extracting and Reasoning about Time and Events. Dagstuhl Seminar Proceedings, Volume 5151, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
https://doi.org/10.4230/DagSemProc.05151.8

Abstract

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.
Keywords
  • Information Extraction
  • Interval temporal logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail