Skip to main content

Formal Verification of Temporal Questions in the Context of Query-Answering Text Summarization

  • Conference paper
Book cover Advances in Artificial Intelligence (Canadian AI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7310))

Included in the following conference series:

Abstract

This paper presents a novel method for answering complex temporal ordering questions in the context of an event and query-based text summarization. This task is accomplished by precisely mapping the problem of “query-based summarization of temporal ordering questions” in the field of Natural Language Processing to “verifying a finite state model against a temporal formula” in the realm of Model Checking. This mapping requires specific definitions, structures, and procedures. The output of this new approach is promisingly a readable and informative summary satisfying the user’s needs.

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

Access this chapter

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. Biere, A., Cimatti, A., Clarke, E., Strichman, O., Zhu., Y.: Bounded model checking. In: Advances in Computers, vol. 58. Academic Press (2003)

    Google Scholar 

  2. Chali, Y., Joty, S.: Unsupervised Approach for Selecting Sentences in Query-based Summarization. In: FLAIRS (2008)

    Google Scholar 

  3. Doron, O.G., Clarke, E.M., Orna Grumberg, J.: Model Checking. MIT Press (1999)

    Google Scholar 

  4. Cimatti, A., Clarke, E.M., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV: a new symbolic model checker. It’l. J. on STTT 2(4), 410–425 (2000)

    MATH  Google Scholar 

  5. Harabagiu, S., Bejan, C.A.: Question Answering Based on Temporal Inference. In: AAAI Workshop on Inference for Textual QA (2005)

    Google Scholar 

  6. 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: AAAI Symposium on New Directions in QA, pp. 28–34 (2003)

    Google Scholar 

  7. Sequete, E., Martinez-Barco, P., Munoz, R., Vicedo, J.: Splitting Complex Temporal Questions for QA Systems. ACL (2004)

    Google Scholar 

  8. Sequete, E., Vicedo, J.L., Martinez-Barco, P., Munoz, R., Llorens, H.: Enhancing QA systems with complex temporal question processing capabilities. JAIR 35, 755–811 (2009)

    Google Scholar 

  9. Schockaert, S., Ahn, D., De Cock, M., Kerre, E.E.: Question Answering with Imperfect Temporal Information. In: Larsen, H.L., Pasi, G., Ortiz-Arroyo, D., Andreasen, T., Christiansen, H. (eds.) FQAS 2006. LNCS (LNAI), vol. 4027, pp. 647–658. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mostafazadeh, N., Bakhshandeh Babarsad, O., Ghassem-Sani, G. (2012). Formal Verification of Temporal Questions in the Context of Query-Answering Text Summarization. In: Kosseim, L., Inkpen, D. (eds) Advances in Artificial Intelligence. Canadian AI 2012. Lecture Notes in Computer Science(), vol 7310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30353-1_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30353-1_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30352-4

  • Online ISBN: 978-3-642-30353-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics