Skip to main content
SpringerLink
Log in

Constraint Logic Programming for Resolution of Relative Time Expressions

  • Conference paper
Language, Life, Limits (CiE 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8493))

Included in the following conference series:

  • 718 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Frühwirth, T.: Constraint Handling Rules. Cambridge University Press (2009)

    Google Scholar 

  2. Strötgen, J., Gertz, M.: Heideltime: High quality rule-based extraction and normalization of temporal expressions. In: Proceedings of the 5th International Workshop on Semantic Evaluation, SemEval 2010, pp. 321–324. Association for Computational Linguistics, Stroudsburg (2010)

    Google Scholar 

  3. Strötgen, J., Gertz, M.: Multilingual and cross-domain temporal tagging. Language Resources and Evaluation 47(2), 269–298 (2013)

    Article  Google Scholar 

  4. de Medeiros Caseli, H., Villavicencio, A., Teixeira, A.J.S., Perdigão, F.: Computational Processing of the Portuguese Language. In: de Medeiros Caseli, H., Villavicencio, A., Teixeira, A.J.S., Perdigão, F. (eds.) PROPOR 2012. LNCS, vol. 7243, pp. 1–11. Springer, Heidelberg (2012)

    Google Scholar 

  5. Hovy, D., Fan, J., Gliozzo, A.M., Patwardhan, S., Welty, C.A.: When did that happen? - Linking events and relations to timestamps. In: Daelemans, W., Lapata, M., Màrquez, L. (eds.) EACL, pp. 185–193. The Association for Computer Linguistics (2012)

    Google Scholar 

  6. Chambers, N.: Labeling documents with timestamps: Learning from their time expressions. In: ACL (1), pp. 98–106. The Association for Computer Linguistics (2012)

    Google Scholar 

  7. Verhagen, M., Gaizauskas, R.J., Schilder, F., Hepple, M., Moszkowicz, J., Pustejovsky, J.: The TempEval challenge: identifying temporal relations in text. Language Resources and Evaluation 43(2), 161–179 (2009)

    Article  Google Scholar 

  8. Pustejovsky, J., Castaño, J.M., Ingria, R., Sauri, R., Gaizauskas, R.J., Setzer, A., Katz, G., Radev, D.R.: Timeml: Robust specification of event and temporal expressions in text. In: Maybury, M.T. (ed.) New Directions in Question Answering, pp. 28–34. AAAI Press (2003)

    Google Scholar 

  9. Mazur, P.P., Dale, R.: LTIMEX: representing the local semantics of temporal expressions. In: Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.) FedCSIS, pp. 201–208 (2011)

    Google Scholar 

  10. Eshghi, K.: Abductive planning with event calculus. In: Kowalski, R.A., Bowen, K.A. (eds.) ICLP/SLP, pp. 562–579. MIT Press (1988)

    Google Scholar 

  11. Allen, J.F.: Towards a general theory of action and time. Artif. Intell. 23(2), 123–154 (1984)

    Article  MATH  Google Scholar 

  12. Han, B., Lavie, A.: A framework for resolution of time in natural language. ACM Trans. Asian Lang. Inf. Process. 3(1), 11–32 (2004)

    Article  Google Scholar 

  13. Bry, F., Rieß, F.A., Spranger, S.: CaTTS: calendar types and constraints for web applications. In: Ellis, A., Hagino, T. (eds.) WWW, pp. 702–711. ACM (2005)

    Google Scholar 

  14. van de Camp, M., Christiansen, H.: Resolving Relative Time Expressions in Dutch Text with Constraint Handling Rules. In: Duchier, D., Parmentier, Y. (eds.) Constraint Solving and Language Processing. LNCS, vol. 8114, pp. 166–177. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  15. Christiansen, H., Dahl, V.: HYPROLOG: A New Logic Programming Language with Assumptions and Abduction. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 159–173. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Christiansen, H.: Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules. J. Applied Logic 7(3), 341–362 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  17. Christiansen, H.: Constraint programming for context comprehension (to appear, 2014)

    Google Scholar 

  18. Christiansen, H.: Abductive language interpretation as bottom-up deduction. In: Wintner, S. (ed.) Natural Language Understanding and Logic Programming, Roskilde, Denmark. Datalogiske Skrifter, vol. 92, pp. 33–47 (2002)

    Google Scholar 

  19. Christiansen, H.: CHR Grammars. Int’l Journal on Theory and Practice of Logic Programming 5(4-5), 467–501 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  20. Christiansen, H., Have, C.T., Tveitane, K.: From use cases to UML class diagrams using logic grammars and constraints. In: RANLP 2007: Proc. Intl. Conf. Recent Adv. Nat. Lang. Processing, pp. 128–132 (2007)

    Google Scholar 

  21. Christiansen, H., Have, C.T., Tveitane, K.: Reasoning about use cases using logic grammars and constraints. In: CSLP 2007: Proc. 4th Intl. Workshop on Constraints and Language Processing. Roskilde University Computer Science Research Report, vol. 113, pp. 40–52 (2007)

    Google Scholar 

  22. Dahl, V., Blache, P.: Implantation de grammaires de propriétés en CHR. In: Mesnard, F. (ed.) Actes des 13èmes Journées Francophones de Programmation en Logique avec Contraintes, Hermes (2004)

    Google Scholar 

  23. Bavarian, M., Dahl, V.: Constraint based methods for biological sequence analysis. Journal of Universal Computing Science 12(11), 1500–1520 (2006)

    Google Scholar 

  24. Dahl, V., Gu, B.: A CHRG analysis of ambiguity in biological texts. In: CSLP 2007: Proc. 4th Intl. Workshop on Constraints and Language Processing. Roskilde University Computer Science Research Report, vol. 113, pp. 53–64 (2007)

    Google Scholar 

  25. Christiansen, H., Li, B.: Approaching the chinese word segmentation problem with CHR grammars. In: CSLP 2011: Proc. 4th Intl. Workshop on Constraints and Language Processing. Roskilde University Computer Science Research Report, vol. 134, pp. 21–31 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research group PLIS: Programming, Logic and Intelligent Systems, Department of Communication, Business and Information Technologies, Roskilde University, Denmark

    Henning Christiansen

Authors
  1. Henning Christiansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Science, Department of Computer Science, Swansea University, SA2 8PP, Swansea, UK

    Arnold Beckmann

  2. Department of Algorithms and Their Applications, Eötvös Loránd University, Pázmány Péter sétány 1/c,, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  3. Computer Science Institute, Brandenburg University of Technology Cottbus-Senftenberg, Cottbus, Germany

    Klaus Meer

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Christiansen, H. (2014). Constraint Logic Programming for Resolution of Relative Time Expressions. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08019-2_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08018-5

  • Online ISBN: 978-3-319-08019-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation