Reformulating Queries: Theory and Practice
Lists
Only you see this
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.
BibTeX
@inproceedings{benedikt2017reformulating,
author = {Michael Benedikt and Egor V. Kostylev and Fabio Mogavero and Efthymia Tsamoura},
title = {{Reformulating Queries: Theory and Practice}},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2017},
doi = {10.24963/ijcai.2017/116},
}| Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics | arXiv · 2017 |
| A Comparison of Query Rewriting Techniques for DL-lite | Description Logics · 2009 |
| Query Rewriting Beyond DL-Lite | Description Logics · 2015 |
| From Conjunctive Queries to Instance Queries in Ontology-Mediated Querying | arXiv · 2020 |
| Polynomial Rewritings from Expressive Description Logics with Closed Predicates to Variants of Datalog | arXiv · 2019 |
| Query Repairs | arXiv · 2025 |