English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

TEQUILA: Temporal Question Answering over Knowledge Bases

MPS-Authors
/persons/resource/persons123292

Abujabal,  Abdalghani
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons185343

Saha Roy,  Rishiraj
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)

arXiv:1908.03650.pdf
(Preprint), 147KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Jia, Z., Abujabal, A., Saha Roy, R., Strötgen, J., & Weikum, G. (2019). TEQUILA: Temporal Question Answering over Knowledge Bases. Retrieved from http://arxiv.org/abs/1908.03650.


Cite as: http://hdl.handle.net/21.11116/0000-0005-83BE-1
Abstract
Question answering over knowledge bases (KB-QA) poses challenges in handling complex questions that need to be decomposed into sub-questions. An important case, addressed here, is that of temporal questions, where cues for temporal relations need to be discovered and handled. We present TEQUILA, an enabler method for temporal QA that can run on top of any KB-QA engine. TEQUILA has four stages. It detects if a question has temporal intent. It decomposes and rewrites the question into non-temporal sub-questions and temporal constraints. Answers to sub-questions are then retrieved from the underlying KB-QA engine. Finally, TEQUILA uses constraint reasoning on temporal intervals to compute final answers to the full question. Comparisons against state-of-the-art baselines show the viability of our method.