Reformulating queries: theory and practice
We consider a setting where a user wants to pose a query against a dataset where some 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, arrivi...
| Príomhchruthaitheoirí: | , , , |
|---|---|
| Formáid: | Conference item |
| Foilsithe / Cruthaithe: |
IJCAI
2017
|
| _version_ | 1826296669209100288 |
|---|---|
| author | Benedikt, M Kostylev, E Mogavero, F Tsamoura, E |
| author_facet | Benedikt, M Kostylev, E Mogavero, F Tsamoura, E |
| author_sort | Benedikt, M |
| collection | OXFORD |
| description | We consider a setting where a user wants to pose a query against a dataset where some 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 that is 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 first present a classification of the complexity of the problem, showing that distinct techniques are needed for the two variations above. We then present algorithms for solving the problems in practice and evaluate their performance. |
| first_indexed | 2024-03-07T04:19:53Z |
| format | Conference item |
| id | oxford-uuid:caac70b1-220f-4c82-b29e-1ea8f960c7c2 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T04:19:53Z |
| publishDate | 2017 |
| publisher | IJCAI |
| record_format | dspace |
| spelling | oxford-uuid:caac70b1-220f-4c82-b29e-1ea8f960c7c22022-03-27T07:09:04ZReformulating queries: theory and practiceConference itemhttp://purl.org/coar/resource_type/c_5794uuid:caac70b1-220f-4c82-b29e-1ea8f960c7c2Symplectic Elements at OxfordIJCAI2017Benedikt, MKostylev, EMogavero, FTsamoura, EWe consider a setting where a user wants to pose a query against a dataset where some 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 that is 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 first present a classification of the complexity of the problem, showing that distinct techniques are needed for the two variations above. We then present algorithms for solving the problems in practice and evaluate their performance. |
| spellingShingle | Benedikt, M Kostylev, E Mogavero, F Tsamoura, E Reformulating queries: theory and practice |
| title | Reformulating queries: theory and practice |
| title_full | Reformulating queries: theory and practice |
| title_fullStr | Reformulating queries: theory and practice |
| title_full_unstemmed | Reformulating queries: theory and practice |
| title_short | Reformulating queries: theory and practice |
| title_sort | reformulating queries theory and practice |
| work_keys_str_mv | AT benediktm reformulatingqueriestheoryandpractice AT kostyleve reformulatingqueriestheoryandpractice AT mogaverof reformulatingqueriestheoryandpractice AT tsamourae reformulatingqueriestheoryandpractice |