Reformulating Queries: Theory and Practice
Abstract
We consider a setting where a user wants to pose a query against a dataset where background knowledge, expressed as logical sentences, is available, but only a subset of the information can be used to answer the query. We thus want to reformulate the user query against the subvocabulary, arriving at a query equivalent to the user’s query assuming the background theory, but using only the restricted vocabulary. We consider two variations of the problem, one where we want any such reformulation and another where we restrict the size. We present a classification of the complexity of the problem, then provide algorithms for solving the problems in practice and evaluate their performance.
Cite
Text
Benedikt et al. "Reformulating Queries: Theory and Practice." International Joint Conference on Artificial Intelligence, 2017. doi:10.24963/IJCAI.2017/116Markdown
[Benedikt et al. "Reformulating Queries: Theory and Practice." International Joint Conference on Artificial Intelligence, 2017.](https://mlanthology.org/ijcai/2017/benedikt2017ijcai-reformulating/) doi:10.24963/IJCAI.2017/116BibTeX
@inproceedings{benedikt2017ijcai-reformulating,
title = {{Reformulating Queries: Theory and Practice}},
author = {Benedikt, Michael and Kostylev, Egor V. and Mogavero, Fabio and Tsamoura, Efthymia},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2017},
pages = {837-843},
doi = {10.24963/IJCAI.2017/116},
url = {https://mlanthology.org/ijcai/2017/benedikt2017ijcai-reformulating/}
}