{"type":"ScholarlyArticle","title":"Reformulating Queries: Theory and Practice","authors":[{"name":"Michael Benedikt","slug":"michael-benedikt","given":"Michael","family":"Benedikt","affiliation":"University of Oxford"},{"name":"Egor V. Kostylev","slug":"egor-v-kostylev","given":"Egor V.","family":"Kostylev","affiliation":"University of Oxford"},{"name":"Fabio Mogavero","slug":"fabio-mogavero","given":"Fabio","family":"Mogavero","affiliation":"University of Oxford"},{"name":"Efthymia Tsamoura","slug":"efthymia-tsamoura","given":"Efthymia","family":"Tsamoura","affiliation":"Alan Turing Institute &; University of Oxford"}],"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.","doi":"10.24963/ijcai.2017/116","url":"https://ijcai.org/proceedings/2017/116","pdf":"https://ijcai.org/proceedings/2017/0116.pdf","markdown":"https://ijcai.org/proceedings/2017/116.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/116","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":116,"pages":{"first":837,"last":843},"keywords":["Knowledge Representation, Reasoning, and Logic: Logics for Knowledge Representation","Knowledge Representation, Reasoning, and Logic: Computational Complexity of Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Benedikt et al., 2016] Michael Benedikt, Balder Ten Cate, Julien Leblay, and Efthymia Tsamoura. Generating plans from proofs: the interpolation-based approach to query reformulation. Morgan Claypool, 2016.","title":"Generating plans from proofs: the interpolation-based approach to query reformulation","authors":"Michael Benedikt, Ten Balder, Julien Cate, Efthymia Leblay, Tsamoura","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Benedikt et al., 2017] Michael Benedikt, Egor V. Kostylev, Fabio Mogavero, and Efthymia Tsamoura. Query re- formulation: Theory and practice, 2017. Available at www.github.com/qreform/ijcai17qreform.","title":"Query reformulation: Theory and practice","authors":"Michael Benedikt, V Egor, Fabio Kostylev, Efthymia Mogavero, Tsamoura","year":"2017","venue":null,"doi":null,"url":"www.github.com/qreform/ijcai17qreform","internal_url":null},{"position":3,"raw":"[Bonacina and Johansson, 2011] Maria Paola Bonacina and Moa Johansson. On interpolation in decision procedures. In Automated Reasoning with Analytic Tableaux and Re- lated Methods. 2011.","title":"On interpolation in decision procedures","authors":"Maria, Paola Bonacina, Moa Johansson","year":"2011","venue":"Automated Reasoning with Analytic Tableaux and Related Methods","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Buchfuhrer and Umans, 2011] David Buchfuhrer and Christopher Umans. The complexity of boolean formula minimization. J. Comput. Syst. Sci., 77(1):142-153, 2011.","title":"David Buchfuhrer and Christopher Umans. The complexity of boolean formula minimization","authors":"Umans Buchfuhrer","year":"2011","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Calì et al., 2010] Andrea Calì, Georg Gottlob, and Andreas Pieris. Query Answering under Non-guarded Rules in Datalog+/-. In Web Reasoning and Rule Systems, 2010.","title":"Query Answering under Non-guarded Rules in Datalog+","authors":"Andrea Calì, Georg Gottlob, Andreas Pieris","year":"2010","venue":"Web Reasoning and Rule Systems","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cate et al., 2006] Balder ten Cate, Willem Conradie, Maarten Marx, and Yde Venema. Definitorially complete description logics. In KR, 2006.","title":"Definitorially complete description logics","authors":"Cate","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cimatti et al., 2013] Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, and Roberto Sebastiani. The MathSAT5 SMT solver. In TACAS, 2013.","title":"The MathSAT5 SMT solver","authors":"Alessandro Cimatti, Alberto Griggio, Bastiaan Joost Schaafsma, Roberto Sebastiani","year":"2013","venue":"TACAS","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Craig, 1957a] William Craig. Linear reasoning. A new form of the Herbrand-Gentzen theorem. The Journal of Sym- bolic Logic, 22(03):250-268, 1957.","title":"Linear reasoning. A new form of the Herbrand-Gentzen theorem","authors":"Craig ;, William Craig","year":"1957","venue":"The Journal of Symbolic Logic","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Craig, 1957b] William Craig. Three uses of the Herbrand- Gentzen theorem in relating model theory and proof the- ory. Journal of Symbolic Logic, 22(3):269-285, 1957.","title":"Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory","authors":"Craig ;, William Craig","year":"1957","venue":"Journal of Symbolic Logic","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Deutsch et al., 2006] Alin Deutsch, Lucian Popa, and Val Tannen. Query reformulation with constraints. SIGMOD Record, 35(1):65-73, 2006.","title":"Query reformulation with constraints","authors":"Alin Deutsch, Lucian Popa, Val Tannen","year":"2006","venue":"SIGMOD Record","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Deutsch et al., 2008] Alin Deutsch, Alan Nash, and Jeff Remmel. The chase revisited. In PODS, 2008.","title":"The chase revisited","authors":"Alin Deutsch, Alan Nash, Jeff Remmel","year":"2008","venue":"PODS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Eiter et al., 1997] Thomas Eiter, Georg Gottlob, and Heikki Mannila. Disjunctive Datalog. ACM Trans. Database Syst., 22(3):364-418, 1997.","title":"Disjunctive Datalog","authors":"Thomas Eiter, Georg Gottlob, Heikki Mannila","year":"1997","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Fagin et al., 2005] Ronald Fagin, Phokion G. Kolaitis, Re- nee J. Miller, and Lucian Popa. Data exchange: Seman- tics and query answering. Theoretical Computer Science, 336(1):89-124, 2005.","title":"Data exchange: Semantics and query answering","authors":"Ronald Fagin, G Phokion, Renee J Kolaitis, Lucian Miller, Popa","year":"2005","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hoder et al., 2010] Kryštof Hoder, Laura Kovács, and An- drei Voronkov. Interpolation and Symbol Elimination in Vampire. 2010.","title":"Interpolation and Symbol Elimination in Vampire","authors":"Kryštof Hoder, Laura Kovács, Andrei Voronkov","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Hoder et al., 2012] Krystof Hoder, Andreas Holzer, Laura Kovács, and Andrei Voronkov. Vinter: A Vampire-Based tool for interpolation. In APLAS, 2012.","title":"Vinter: A Vampire-Based tool for interpolation","authors":"Krystof Hoder, Andreas Holzer, Laura Kovács, Andrei Voronkov","year":"2012","venue":"APLAS","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Huang, 1995] Guoxiang Huang. Constructing Craig inter- polation formulas. In Computing and Combinatorics. 1995.","title":"Constructing Craig interpolation formulas","authors":"Guoxiang Huang","year":"1995","venue":"Computing and Combinatorics","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hudek et al., 2015] Alexander K. Hudek, David Toman, and Grant E. Weddell. On enumerating query plans using analytic tableau. In TABLEAUX, 2015.","title":"On enumerating query plans using analytic tableau","authors":"Alexander K Hudek, David Toman, Grant E Weddell","year":"2015","venue":"TABLEAUX","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Ileana et al., 2014] Ioana Ileana, Bogdan Cautis, Alin Deutsch, and Yannis Katsis. Complete yet practical search for minimal query reformulations under constraints. In SIGMOD, 2014.","title":"Complete yet practical search for minimal query reformulations under constraints","authors":"Ioana Ileana, Bogdan Cautis, Alin Deutsch, Yannis Katsis","year":"2014","venue":"SIGMOD","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Konev et al., 2009] Boris Konev, Dirk Walther, and Frank Wolter. Forgetting and uniform interpolation in large-scale description logic terminologies. In IJCAI, 2009.","title":"Forgetting and uniform interpolation in large-scale description logic terminologies","authors":"Boris Konev, Dirk Walther, Frank Wolter","year":"2009","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2009/142"},{"position":20,"raw":"[Konev et al., 2010] Boris Konev, Carsten Lutz, Denis K. Ponomaryov, and Frank Wolter. Decomposing description logic ontologies. In KR, 2010.","title":"Decomposing description logic ontologies","authors":"Boris Konev, Carsten Lutz, Denis K Ponomaryov, Frank Wolter","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Koopmann and Nikitina, 2017] Patrick Koopmann and Nadeschda Nikitina. Small is beautiful: Computing minimal equivalent EL concepts. In AAAI, 2017.","title":"Small is beautiful: Computing minimal equivalent EL concepts","authors":"Nikitina Koopmann, Patrick Koopmann, Nadeschda Nikitina","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lang et al., 2003] Jérôme Lang, Paolo Liberatore, and Pierre Marquis. Propositional independence: Formula- variable independence and forgetting. J. Artif. Intell. Res. (JAIR), 18:391-443, 2003.","title":"Propositional independence: Formulavariable independence and forgetting","authors":"Jérôme Lang, Paolo Liberatore, Pierre Marquis","year":"2003","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Leone et al., 2006] N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The DLV sys- tem for knowledge representation and reasoning. TOCL, 7(3):499-562, 2006.","title":"The DLV system for knowledge representation and reasoning","authors":"N Leone, G Pfeifer, W Faber, T Eiter, G Gottlob, S Perri, F Scarcello","year":"2006","venue":"TOCL","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Lutz and Wolter, 2011] Carsten Lutz and Frank Wolter. Foundations for uniform interpolation and forgetting in ex- pressive description logics. In IJCAI, 2011.","title":"Foundations for uniform interpolation and forgetting in expressive description logics","authors":"Wolter Lutz, Carsten Lutz, Frank Wolter","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/170"},{"position":25,"raw":"[Lutz et al., 2012] Carsten Lutz, Inanc ¸Seylan, and Frank Wolter. An automata-theoretic approach to uniform inter- polation and approximation in the description logic EL. In KR, 2012.","title":"An automata-theoretic approach to uniform interpolation and approximation in the description logic EL","authors":"Carsten Lutz, Frank Inanc ¸seylan, Wolter","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Lyndon, 1959] Roger C. Lyndon. An interpolation theorem in the predicate calculus. Pacific Journal of Mathemantics, 9:129-142, 1959.","title":"An interpolation theorem in the predicate calculus","authors":"Roger C Lyndon","year":"1959","venue":"Pacific Journal of Mathemantics","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[McMillan, 2003] K. L. McMillan. Interpolation and sat- based model checking. In CAV, 2003.","title":"Interpolation and satbased model checking","authors":"K L Mcmillan","year":"2003","venue":"CAV","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Meier, 2014] Michael Meier. The backchase revisited. VLDB Journal, 23(3):495-516, 2014.","title":"The backchase revisited","authors":"Michael Meier","year":"2014","venue":"VLDB Journal","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Nikitina and Rudolph, 2014] Nadeschda Nikitina and Se- bastian Rudolph. (Non-)Succinctness of uniform inter- polants of general terminologies in the description logic EL. Artif. Intell., 215:120-140, 2014.","title":"Nadeschda Nikitina and Sebastian Rudolph. (Non-)Succinctness of uniform interpolants of general terminologies in the description logic EL","authors":"Rudolph Nikitina","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Popa, 2000] Lucian Popa. Object/Relational Query Opti- mization with Chase and Backchase. PhD thesis, U. Penn., 2000.","title":"Lucian Popa. Object/Relational Query Optimization with Chase and Backchase","authors":"Popa","year":"2000","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Schulz, 2013] Stephan Schulz. System Description: E 1.8. In LPAR, 2013.","title":"System Description: E 1.8","authors":"Stephan Schulz","year":"2013","venue":"LPAR","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Toman and Weddell, 2011] D. Toman and G. Weddell. Fun- damentals of Physical Design and Query Compilation. Morgan Claypool, 2011.","title":"Fundamentals of Physical Design and Query Compilation","authors":"D Toman, G Weddell","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Umans, 2001] Christopher Umans. The minimum equiva- lent DNF problem and shortest implicants. J. Comput. Syst. Sci., 63(4):597-611, 2001.","title":"The minimum equivalent DNF problem and shortest implicants","authors":"Christopher Umans","year":"2001","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}