{"type":"ScholarlyArticle","title":"Reverse Engineering Queries in Ontology-Enriched Systems: The Case of Expressive Horn Description Logic Ontologies","authors":[{"name":"Víctor Gutiérrez-Basulto","slug":"victor-gutierrez-basulto","given":"Víctor","family":"Gutiérrez-Basulto","affiliation":"Cardiff University , UK"},{"name":"Jean Christoph Jung","slug":"jean-christoph-jung","given":"Jean Christoph","family":"Jung","affiliation":"University of Bremen , Germany; KU Leuven , Belgium"},{"name":"Leif Sabellek","slug":"leif-sabellek","given":"Leif","family":"Sabellek","affiliation":"University of Bremen , Germany"}],"abstract":"We introduce the query-by-example (QBE) paradigm for query answering in the presence of ontologies. Intuitively, QBE permits non-expert users to explore the data by providing examples of the information they (do not) want, which the system then generalizes into a query. Formally, we study the following question: given a knowledge base and sets of positive and negative examples, is there a query that returns all positive but none of the negative examples?  We focus on description logic knowledge bases with ontologies formulated in Horn-ALCI and (unions of) conjunctive queries. Our main contributions are characterizations, algorithms and tight complexity bounds for QBE.","doi":"10.24963/ijcai.2018/255","url":"https://ijcai.org/proceedings/2018/255","pdf":"https://ijcai.org/proceedings/2018/0255.pdf","markdown":"https://ijcai.org/proceedings/2018/255.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/255","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":255,"pages":{"first":1847,"last":1853},"keywords":["Knowledge Representation and Reasoning: Description Logics and Ontologies","Knowledge Representation and Reasoning: Knowledge Representation Languages","Knowledge Representation and Reasoning: Computational Complexity of Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Arenas et al., 2016] Marcelo Arenas, Gonzalo I. Diaz, and Egor V. Kostylev. Reverse engineering SPARQL queries. In Proc. of WWW-16, pages 239-249, 2016.","title":"Reverse engineering SPARQL queries","authors":"Marcelo Arenas, Gonzalo I Diaz, Egor V Kostylev","year":"2016","venue":"Proc. of WWW-16","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baader et al., 2017] Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. An Introduction to Description Logics. Cambride University Press, 2017.","title":"An Introduction to Description Logics","authors":"Baader","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Barceló and Romero, 2017] Pablo Barceló and Miguel Romero. The complexity of reverse engineering problems for conjunctive queries. In Proc. of ICDT-17, 2017.","title":"Pablo Barceló and Miguel Romero. The complexity of reverse engineering problems for conjunctive queries","authors":"Romero Barceló","year":"2017","venue":"Proc. of ICDT-17","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bienvenu and Ortiz, 2015] Meghyn Bienvenu and Mag- dalena Ortiz. Ontology-mediated query answering with data-tractable description logics. In Proc. of RW-15, 2015.","title":"Meghyn Bienvenu and Magdalena Ortiz. Ontology-mediated query answering with data-tractable description logics","authors":"Ortiz Bienvenu","year":"2015","venue":"Proc. of RW-15","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bienvenu et al., 2016] Meghyn Bienvenu, Peter Hansen, Carsten Lutz, and Frank Wolter. First order-rewritability and containment of conjunctive queries in Horn description logics. In Proc. of IJCAI-16, pages 965-971, 2016.","title":"First order-rewritability and containment of conjunctive queries in Horn description logics","authors":"Bienvenu","year":"2016","venue":"Proc. of IJCAI-16","doi":null,"url":null,"internal_url":"/proceedings/2016/141"},{"position":6,"raw":"[Bonifati et al., 2014] Angela Bonifati, Radu Ciucanu, and Slawek Staworko. Interactive inference of join queries. In Proc. of EDBT-14, pages 451-462, 2014.","title":"Interactive inference of join queries","authors":"Angela Bonifati, Radu Ciucanu, Slawek Staworko","year":"2014","venue":"Proc. of EDBT-14","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bonifati et al., 2015] Angela Bonifati, Radu Ciucanu, and Aurélien Lemay. Learning path queries on graph databases. In Proc. EDBT-15, pages 109-120, 2015.","title":"Learning path queries on graph databases","authors":"Angela Bonifati, Radu Ciucanu, Aurélien Lemay","year":"2015","venue":"Proc. EDBT-15","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bonifati et al., 2016] Angela Bonifati, Radu Ciucanu, and Slawek Staworko. Learning join queries from user exam- ples. ACM Trans. Database Syst., 40(4):24:1-24:38, 2016.","title":"Learning join queries from user examples","authors":"Angela Bonifati, Radu Ciucanu, Slawek Staworko","year":"2016","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Botoeva et al., 2016a] Elena Botoeva, Boris Konev, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter, and Michael Za- kharyaschev. Inseparability and conservative extensions of description logic ontologies: A survey. In Proc. of RW-16, 2016.","title":"Inseparability and conservative extensions of description logic ontologies: A survey","authors":"Botoeva","year":"2016","venue":"Proc. of RW-16","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Botoeva et al., 2016b] Elena Botoeva, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter, and Michael Za- kharyaschev. Query-based entailment and inseparability for ALC ontologies. In Proc. of IJCAI-16, 2016.","title":"Query-based entailment and inseparability for ALC ontologies","authors":"Botoeva","year":"2016","venue":"Proc. of IJCAI-16","doi":null,"url":null,"internal_url":"/proceedings/2016/146"},{"position":11,"raw":"[Calvanese et al., 2016] Diego Calvanese, Pietro Liuzzo, Alessandro Mosca, José Remesal, Martin Rezk, and Guillem Rull. Ontology-based data integration in epnet: Production and distribution of food during the roman em- pire. Eng. Appl. of AI, 51:212-229, 2016.","title":"Ontology-based data integration in epnet: Production and distribution of food during the roman empire","authors":"Calvanese","year":"2016","venue":"Eng. Appl. of AI","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Carayol and Hague, 2014] Arnaud Carayol and Matthew Hague. Regular strategies in pushdown reachability games. In Proc. of Reachability Problems, RP-14, 2014.","title":"Regular strategies in pushdown reachability games","authors":"Hague Carayol, Arnaud Carayol, Matthew Hague","year":"2014","venue":"Proc. of Reachability Problems","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Chandra et al., 1981] Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. J. ACM, 28(1):114- 133, January 1981.","title":"Alternation","authors":"K Ashok, Dexter C Chandra, Larry J Kozen, Stockmeyer","year":"1981","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Cohen and Page, 1995] William W. Cohen and C. David Page. Polynomial learnability and inductive logic program- ming: Methods and results. New Generation Comput., 13(3&4):369-409, 1995.","title":"Polynomial learnability and inductive logic programming: Methods and results","authors":"William W Cohen, C David Page","year":"1995","venue":"New Generation Comput","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Diaz et al., 2016] Gonzalo I. Diaz, Marcelo Arenas, and Michael Benedikt. Sparqlbye: Querying RDF data by example. PVLDB, 9(13):1533-1536, 2016.","title":"Sparqlbye: Querying RDF data by example","authors":"Gonzalo I Diaz, Marcelo Arenas, Michael Benedikt","year":"2016","venue":"PVLDB","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Grohe and Ritzert, 2017] Martin Grohe and Martin Ritzert. Learning first-order definable concepts over structures of small degree. In Proc. of LICS-17, pages 1-12, 2017.","title":"Learning first-order definable concepts over structures of small degree","authors":"Ritzert Grohe, Martin Grohe, Martin Ritzert","year":"2017","venue":"Proc. of LICS-17","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hovland et al., 2017] Dag Hovland, Roman Kontchakov, Martin G. Skjæveland, Arild Waaler, and Michael Za- kharyaschev. Ontology-based data access to Slegge. In Proc. of ISWC-17, pages 120-129, 2017.","title":"Ontology-based data access to Slegge","authors":"Hovland","year":"2017","venue":"Proc. of ISWC-17","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Jung et al., 2017] Jean Christoph Jung, Carsten Lutz, Mauri- cio Martel, and Thomas Schneider. Query conservative extensions in horn description logics with inverse roles. In Proc. of IJCAI-17, 2017.","title":"Query conservative extensions in horn description logics with inverse roles","authors":"Jean Christoph, Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider","year":"2017","venue":"Proc. of IJCAI-17","doi":null,"url":null,"internal_url":"/proceedings/2017/155"},{"position":19,"raw":"[Kharlamov et al., 2015] Evgeny Kharlamov, Dag Hovland, Ernesto Jiménez-Ruiz, Davide Lanti, Hallstein Lie, Christoph Pinkel, Martín Rezk, Martin G. Skjæveland, Ev- genij Thorstensen, Guohui Xiao, Dmitriy Zheleznyakov, and Ian Horrocks. Ontology based access to exploration data at Statoil. In Proc. of ISWC-15, pages 93-112, 2015.","title":"Ontology based access to exploration data at Statoil","authors":"Evgeny Kharlamov, Dag Hovland, Ernesto Jiménez-Ruiz, Davide Lanti, Hallstein Lie, Christoph Pinkel, Martín Rezk, Martin G Skjæveland, Evgenij Thorstensen, Guohui Xiao, Dmitriy Zheleznyakov, Ian Horrocks","year":"2015","venue":"Proc. of ISWC-15","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kietz, 2002] Jörg-Uwe Kietz. Learnability of description logic programs. In Inductive Logic Programming, 12th International Conference, ILP 2002, Sydney, Australia, July 9-11, 2002. Revised Papers, pages 117-132, 2002.","title":"Learnability of description logic programs","authors":"Jörg-Uwe Kietz","year":"2002","venue":"Inductive Logic Programming, 12th International Conference, ILP 2002","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Krötzsch et al., 2013] Markus Krötzsch, Sebastian Rudolph, and Pascal Hitzler. Complexities of horn description logics. ACM Trans. Comput. Logic, 14(1):2:1-2:36, 2013.","title":"Complexities of horn description logics","authors":"Krötzsch","year":"2013","venue":"ACM Trans. Comput. Logic","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kupferman et al., 2010] Orna Kupferman, Nir Piterman, and Moshe Y. Vardi. An automata-theoretic approach to infinite-state systems. In Time for Verification, Essays in Memory of Amir Pnueli, pages 202-259, 2010.","title":"An automata-theoretic approach to infinite-state systems","authors":"Orna Kupferman, Nir Piterman, Moshe Y Vardi","year":"2010","venue":"Essays in Memory of Amir Pnueli","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Mottin et al., 2016] Davide Mottin, Matteo Lissandrini, Yan- nis Velegrakis, and Themis Palpanas. Exemplar queries: a new way of searching. VLDB J., 25(6):741-765, 2016.","title":"Exemplar queries: a new way of searching","authors":"Davide Mottin, Matteo Lissandrini, Yannis Velegrakis, Themis Palpanas","year":"2016","venue":"VLDB J","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Nienhuys-Cheng and de Wolf, 1997] Shan-Hwei Nienhuys- Cheng and Ronald de Wolf, editors. Foundations of Induc- tive Logic Programming, volume 1228 of Lecture Notes in Computer Science. Springer, 1997.","title":"Foundations of Inductive Logic Programming","authors":"Nienhuys-Cheng And De Wolf","year":"1997","venue":"Lecture Notes in Computer Science","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Rodriguez-Muro et al., 2013] Mariano Rodriguez-Muro, Roman Kontchakov, and Michael Zakharyaschev. Ontology-based data access: Ontop of databases. In Proc. of ISWC-13, pages 558-573, 2013.","title":"Mariano Rodriguez-Muro, Roman Kontchakov, and Michael Zakharyaschev. Ontology-based data access: Ontop of databases","authors":"Rodriguez-Muro","year":"2013","venue":"Proc. of ISWC-13","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[ten Cate and Dalmau, 2015] Balder ten Cate and Víctor Dal- mau. The product homomorphism problem and applica- tions. In Proc. of ICDT-15, pages 161-176, 2015.","title":"Balder ten Cate and Víctor Dalmau. The product homomorphism problem and applications","authors":"Dalmau Cate","year":"2015","venue":"Proc. of ICDT-15","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Tran et al., 2014] Quoc Trung Tran, Chee Yong Chan, and Srinivasan Parthasarathy. Query reverse engineering. VLDB J., 23(5):721-746, 2014.","title":"Query reverse engineering","authors":"Chee Quoc Trung Tran, Srinivasan Yong Chan, Parthasarathy","year":"2014","venue":"VLDB J","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Zloof, 1975] Moshé M. Zloof. Query-by-example: the in- vocation and definition of tables and forms. In Proc. of VLDB-75, pages 1-24, 1975.","title":"Query-by-example: the invocation and definition of tables and forms","authors":"M Moshé, Zloof","year":"1975","venue":"Proc. of VLDB-75","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}