{"type":"ScholarlyArticle","title":"Reverse Engineering of Temporal Queries Mediated by LTL Ontologies","authors":[{"name":"Marie Fortin","slug":"marie-fortin","given":"Marie","family":"Fortin","affiliation":"Université Paris Cité , CNRS , IRIF , France"},{"name":"Boris Konev","slug":"boris-konev","given":"Boris","family":"Konev","affiliation":"Department of Computer Science , University of Liverpool , UK"},{"name":"Vladislav Ryzhikov","slug":"vladislav-ryzhikov","given":"Vladislav","family":"Ryzhikov","affiliation":"Department of Computer Science and Information Systems , Birkbeck , University of London , UK"},{"name":"Yury Savateev","slug":"yury-savateev","given":"Yury","family":"Savateev","affiliation":"School of Electronics and Computer Science , University of Southampton , UK"},{"name":"Frank Wolter","slug":"frank-wolter","given":"Frank","family":"Wolter","affiliation":"Department of Computer Science , University of Liverpool , UK"},{"name":"Michael Zakharyaschev","slug":"michael-zakharyaschev","given":"Michael","family":"Zakharyaschev","affiliation":"Department of Computer Science and Information Systems , Birkbeck , University of London , UK"}],"abstract":"In reverse engineering of database queries, we aim to construct a query from a given set of  answers and non-answers; it can then be used to explore the data further or as an explanation of the answers and non-answers. We investigate this query-by-example problem for queries formulated in positive fragments of linear temporal logic LTL over timestamped data, focusing on the design of suitable query languages and the combined and data complexity of deciding whether there exists a query in the given language that separates the given answers from non-answers. We consider both plain LTL queries and those mediated by LTL ontologies.","doi":"10.24963/ijcai.2023/360","url":"https://ijcai.org/proceedings/2023/360","pdf":"https://ijcai.org/proceedings/2023/0360.pdf","markdown":"https://ijcai.org/proceedings/2023/360.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/360","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":360,"pages":{"first":3230,"last":3238},"keywords":["Knowledge Representation and Reasoning: KRR: Qualitative, geometric, spatial, and temporal reasoning","Knowledge Representation and Reasoning: KRR: Computational complexity of reasoning","Knowledge Representation and Reasoning: KRR: Description logics and ontologies"],"videos":[],"references":[{"position":1,"raw":"[Arenas et al., 2016] M. Arenas, G. I. Diaz, and E. Kostylev. Reverse engineering SPARQL queries. In Proc. of WWW, pages 239-249, 2016.","title":"Reverse engineering SPARQL queries","authors":"M Arenas, G I Diaz, E Kostylev","year":"2016","venue":"Proc. of WWW","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Artale et al., 2021] A. Artale, R. Kontchakov, A. Kov- tunova, V. Ryzhikov, F. Wolter, and M. Zakharyaschev. First-order rewritability of ontology-mediated queries in linear temporal logic. Artif. Intell., 299:103536, 2021.","title":"First-order rewritability of ontology-mediated queries in linear temporal logic","authors":"A Artale, R Kontchakov, A Kovtunova, V Ryzhikov, F Wolter, M Zakharyaschev","year":"2021","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Artale et al., 2022] A. Artale, R. Kontchakov, A. Kov- tunova, V. Ryzhikov, F. Wolter, and M. Zakharyaschev. First-order rewritability and complexity of two- dimensional temporal ontology-mediated queries. J. Artif. Intell. Res., 75:1223-1291, 2022.","title":"First-order rewritability and complexity of twodimensional temporal ontology-mediated queries","authors":"A Artale, R Kontchakov, A Kovtunova, V Ryzhikov, F Wolter, M Zakharyaschev","year":"2022","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Badea and Nienhuys-Cheng, 2000] L. Badea and S. Nien- huys-Cheng. A refinement operator for description logics. In Proc. of ILP, pages 40-59, 2000.","title":"A refinement operator for description logics","authors":"Nienhuys-Cheng ; Badea, ] L Badea, S Nienhuys-Cheng","year":"2000","venue":"Proc. of ILP","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Barceló and Romero, 2017] P. Barceló and M. Romero. The complexity of reverse engineering problems for conjunc- tive queries. In Proc. of ICDT, pages 7:1-7:17, 2017.","title":"The complexity of reverse engineering problems for conjunctive queries","authors":"P Barceló, M Romero","year":"2017","venue":"Proc. of ICDT","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bergroth et al., 2000] L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms. In Proc. of SPIRE, pages 39-48, 2000.","title":"A survey of longest common subsequence algorithms","authors":"L Bergroth, H Hakonen, T Raita","year":"2000","venue":"Proc. of SPIRE","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Blum et al., 2021] C. Blum, M. Djukanovic, A. Santini, H. Jiang, C. Li, F. Manyà, and G. Raidl. Solving longest common subsequence problems via a transforma- tion to the maximum clique problem. Comput. Oper. Res., 125:105089, 2021.","title":"Solving longest common subsequence problems via a transformation to the maximum clique problem","authors":"C Blum, M Djukanovic, A Santini, H Jiang, C Li, F Manyà, G Raidl","year":"2021","venue":"Comput. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bühmann et al., 2016] L. Bühmann, J. Lehmann, and P. Westphal. DL-learner -A framework for inductive learn- ing on the semantic web. J. Web Sem., 39:15-24, 2016.","title":"DL-learner -A framework for inductive learning on the semantic web","authors":"L Bühmann, J Lehmann, P Westphal","year":"2016","venue":"J. Web Sem","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Camacho and McIlraith, 2019] A. Camacho and S. McIl- raith. Learning interpretable models expressed in linear temporal logic. In Proc. of ICAPS, pages 621-630, 2019.","title":"Learning interpretable models expressed in linear temporal logic","authors":"A Camacho, S Mcilraith","year":"2019","venue":"Proc. of ICAPS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Chen and Lin, 1994] C.-C. Chen and I-Peng Lin. The com- putational complexity of the satisfiability of modal Horn clauses for modal propositional logics. Theor. Comp. Sci., 129(1):95-121, 1994.","title":"The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics","authors":"C.-C Chen, I-Peng Lin","year":"1994","venue":"Theor. Comp. Sci","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Chomicki and Toman, 2018] J. Chomicki and D. Toman. Temporal logic in database query languages. In Encyclo- pedia of Database Systems. Springer, 2018.","title":"Temporal logic in database query languages","authors":"J Chomicki, D Toman","year":"2018","venue":"Encyclopedia of Database Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Chomicki et al., 2001] J. Chomicki, D. Toman, and M. Böhlen. Querying ATSQL databases with temporal logic. ACM Trans. Database Syst., 26(2):145-178, 2001.","title":"Querying ATSQL databases with temporal logic","authors":"J Chomicki, D Toman, M Böhlen","year":"2001","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Chowdhury et al., 2010] R. Chowdhury, H.-S. Le, and V. Ramachandran. Cache-oblivious dynamic programming for bioinformatics. IEEE/ACM Transactions on Computa- tional Biology and Bioinformatics, 7(3):495-510, 2010.","title":"Cache-oblivious dynamic programming for bioinformatics","authors":"R Chowdhury, H.-S Le, V Ramachandran","year":"2010","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Cima et al., 2021] G. Cima, F. Croce, and M. Lenzerini. Query definability and its approximations in ontology- based data management. In Proc. of CIKM, pages 271- 280. ACM, 2021.","title":"Query definability and its approximations in ontologybased data management","authors":"G Cima, F Croce, M Lenzerini","year":"2021","venue":"Proc. of CIKM","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Cohen and Weiss, 2016] S. Cohen and Y. Weiss. The com- plexity of learning tree patterns from example graphs. ACM Trans. Database Syst., 41(2):14:1-14:44, 2016.","title":"The complexity of learning tree patterns from example graphs","authors":"Weiss Cohen, ] S Cohen, Y Weiss","year":"2016","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Demri et al., 2016] S. Demri, V. Goranko, and M. Lange. Temporal Logics in Computer Science. Cambridge Uni- versity Press, 2016.","title":"Temporal Logics in Computer Science","authors":"S Demri, V Goranko, M Lange","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Deutch and Gilad, 2019] D. Deutch and A. Gilad. Reverse- engineering conjunctive queries from provenance exam- ples. In Proc. of EDBT, pages 277-288, 2019.","title":"Reverseengineering conjunctive queries from provenance examples","authors":"D Deutch, A Gilad","year":"2019","venue":"Proc. of EDBT","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fanizzi et al., 2018] N. Fanizzi, G. Rizzo, C. d'Amato, and F. Esposito. DLFoil: Class expression learning revisited. In Proc. of EKAW, pages 98-113, 2018.","title":"DLFoil: Class expression learning revisited","authors":"N Fanizzi, G Rizzo, C Amato, F Esposito","year":"2018","venue":"Proc. of EKAW","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Fijalkow and Lagarde, 2021] N. Fijalkow and G. Lagarde. The complexity of learning linear temporal formulas from examples. In Proc. of 15th Int. Conf. on Grammatical In- ference, volume 153 of PMLR, pages 237-250, 2021.","title":"The complexity of learning linear temporal formulas from examples","authors":"N Fijalkow, G Lagarde","year":"2021","venue":"Proc. of 15th Int. Conf. on Grammatical Inference","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Fortin et al., 2022] M. Fortin, B. Konev, V. Ryzhikov, Y. Sa- vateev, F. Wolter, and M. Zakharyaschev. Unique charac- terisability and learnability of temporal instance queries. In Proc. of KR, 2022.","title":"Unique characterisability and learnability of temporal instance queries","authors":"M Fortin, B Konev, V Ryzhikov, Y Savateev, F Wolter, M Zakharyaschev","year":"2022","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Fortin et al., 2023] M. Fortin, B. Konev, V. Ryzhikov, Y. Sa- vateev, F. Wolter, and M. Zakharyaschev. Reverse engi- neering of temporal queries mediated by LTL ontologies. CoRR, abs/2303.04598, 2023.","title":"Reverse engineering of temporal queries mediated by LTL ontologies","authors":"M Fortin, B Konev, V Ryzhikov, Y Savateev, F Wolter, M Zakharyaschev","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Fraser, 1996] C. Fraser. Consistent subsequences and super- sequences. Theor. Comput. Sci., 165(2):233-246, 1996.","title":"Consistent subsequences and supersequences","authors":"C Fraser","year":"1996","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Funk et al., 2019] M. Funk, J. C. Jung, C. Lutz, H. Pulcini, and F. Wolter. Learning description logic concepts: When can positive and negative examples be separated? In Proc. of IJCAI, pages 1682-1688, 2019.","title":"Learning description logic concepts: When can positive and negative examples be separated?","authors":"M Funk, J C Jung, C Lutz, H Pulcini, F Wolter","year":"2019","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/233"},{"position":24,"raw":"[Gabbay et al., 2003] D. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications, volume 148 of Studies in Logic. Elsevier, 2003.","title":"Many-Dimensional Modal Logics: Theory and Applications","authors":"D Gabbay, A Kurucz, F Wolter, M Zakharyaschev","year":"2003","venue":"Studies in Logic","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Gutiérrez-Basulto et al., 2018] V. Gutiérrez-Basulto, J. Ch. Jung, and L. Sabellek. Reverse engineering queries in ontology-enriched systems: The case of expressive Horn description logic ontologies. In Proc. of IJCAI, 2018.","title":"Reverse engineering queries in ontology-enriched systems: The case of expressive Horn description logic ontologies","authors":"V Gutiérrez-Basulto, J Ch Jung, L Sabellek","year":"2018","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/255"},{"position":26,"raw":"[Heindorf et al., 2022] S. Heindorf, L. Blübaum, N. Düsterhus, T. Werner, V. N. Golani, C. Demir, and A.-C. Ngonga Ngomo. Evolearner: Learning description logics with evolutionary algorithms. In Proc. of WWW, pages 818-828. ACM, 2022.","title":"Evolearner: Learning description logics with evolutionary algorithms","authors":"S Heindorf, L Blübaum, N Düsterhus, T Werner, V N Golani, C Demir, A.-C. Ngonga Ngomo","year":"2022","venue":"Proc. of WWW","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Hofman and Martens, 2015] P. Hofman and W. Martens. Separability by short subsequences and subwords. In Proc. of ICDT, volume 31 of LIPIcs, pages 230-246, 2015.","title":"Separability by short subsequences and subwords","authors":"P Hofman, W Martens","year":"2015","venue":"Proc. of ICDT","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Iannone et al., 2007] L. Iannone, I. Palmisano, and N. Fanizzi. An algorithm based on counterfactuals for concept learning in the Semantic Web. Appl. Intell., 26(2):139-159, 2007.","title":"An algorithm based on counterfactuals for concept learning in the Semantic Web","authors":"L Iannone, I Palmisano, N Fanizzi","year":"2007","venue":"Appl. Intell","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Jung et al., 2020] J. Ch. Jung, C. Lutz, and F. Wolter. Least General Generalizations in Description Logic: Verification and Existence. In Proc. of AAAI, 2020.","title":"Least General Generalizations in Description Logic: Verification and Existence","authors":"J Ch Jung, C Lutz, F Wolter","year":"2020","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Jung et al., 2021] J. Ch. Jung, C. Lutz, H. Pulcini, and F. Wolter. Separating data examples by description logic con- cepts with restricted signatures. In Proc. of KR, 2021.","title":"Separating data examples by description logic concepts with restricted signatures","authors":"J Ch Jung, C Lutz, H Pulcini, F Wolter","year":"2021","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Jung et al., 2022] J. Ch. Jung, C. Lutz, H. Pulcini, and F. Wolter. Logical separability of labeled data examples un- der ontologies. Artif. Intell., 313 (2022).","title":"Logical separability of labeled data examples under ontologies","authors":"J Ch Jung, C Lutz, H Pulcini, F Wolter","year":"2022","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Kalashnikov et al., 2018] D. Kalashnikov, L. Lakshmanan, and D. Srivastava. Fastqre: Fast query reverse engineering. In Proc. of SIGMOD, pages 337-350, 2018.","title":"Fastqre: Fast query reverse engineering","authors":"D Kalashnikov, L Lakshmanan, D Srivastava","year":"2018","venue":"Proc. of SIGMOD","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Kupferman and Vardi, 1996] O. Kupferman and M. Vardi. Verification of fair transisiton systems. In Proc. of CAV, volume 1102 of LNCS, pages 372-382. Springer, 1996.","title":"Verification of fair transisiton systems","authors":"O Kupferman, M Vardi","year":"1996","venue":"Proc. of CAV","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Kurtonina and de Rijke, 1997] N. Kurtonina and M. de Ri- jke. Bisimulations for temporal logic. J. Log. Lang. Inf., 6(4):403-425, 1997.","title":"Bisimulations for temporal logic","authors":"N Kurtonina, M De Rijke","year":"1997","venue":"J. Log. Lang. Inf","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Lehmann and Haase, 2009] J. Lehmann and Ch. Haase. Ideal downward refinement in the EL description logic. In Proc. of ILP, pages 73-87, 2009.","title":"Ideal downward refinement in the EL description logic","authors":"Haase Lehmann, ] J Lehmann, Ch Haase","year":"2009","venue":"Proc. of ILP","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Lehmann and Hitzler, 2010] J. Lehmann and P. Hitzler. Concept learning in description logics using refinement operators. Machine Learning, 78:203-250, 2010.","title":"Concept learning in description logics using refinement operators","authors":"Hitzler Lehmann, ] J Lehmann, P Hitzler","year":"2010","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Lemieux et al., 2015] C. Lemieux, D. Park, and I. Beschast- nikh. General LTL specification mining (T). In Proc. of ASE, pages 81-92. IEEE, 2015.","title":"General LTL specification mining (T)","authors":"C Lemieux, D Park, I Beschastnikh","year":"2015","venue":"Proc. of ASE","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Lisi and Straccia, 2015] F. Lisi and U. Straccia. Learning in description logics with fuzzy concrete domains. Funda- menta Informaticae, 140(3-4):373-391, 2015.","title":"Learning in description logics with fuzzy concrete domains","authors":"F Lisi, U Straccia","year":"2015","venue":"Fundamenta Informaticae","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Lisi, 2012] F. Lisi. A formal characterization of concept learning in description logics. In Proc. of DL, 2012.","title":"A formal characterization of concept learning in description logics","authors":"F Lisi","year":"2012","venue":"Proc. of DL","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Maier, 1978] D. Maier. The complexity of some problems on subsequences and supersequences. J. ACM, 25(2):322- 336, 1978.","title":"The complexity of some problems on subsequences and supersequences","authors":"D Maier","year":"1978","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Martins, 2019] D. Martins. Reverse engineering database queries from examples: State-of-the-art, challenges, and research opportunities. Inf. Syst., 83:89-100, 2019.","title":"Reverse engineering database queries from examples: State-of-the-art, challenges, and research opportunities","authors":"D Martins","year":"2019","venue":"Inf. Syst","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Neider and Gavran, 2018] D. Neider and I. Gavran. Learn- ing linear temporal properties. In Proc. of FMCAD, pages 1-10. IEEE, 2018.","title":"Learning linear temporal properties","authors":"D Neider, I Gavran","year":"2018","venue":"Proc. of FMCAD","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Ono and Nakamura, 1980] H. Ono and A. Nakamura. On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica, pages 325-333, 1980.","title":"On the size of refutation Kripke models for some linear modal and tense logics","authors":"H Ono, A Nakamura","year":"1980","venue":"Studia Logica","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Ortiz, 2019] M. Ortiz. Ontology-mediated queries from ex- amples: a glimpse at the DL-Lite case. In Proc. of GCAI, pages 1-14, 2019.","title":"Ontology-mediated queries from examples: a glimpse at the DL-Lite case","authors":"M Ortiz","year":"2019","venue":"Proc. of GCAI","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Place and Zeitoun, 2016] T. Place and M. Zeitoun. Separat- ing regular languages with first-order logic. Log. Methods Comput. Sci., 12(1), 2016.","title":"Separating regular languages with first-order logic","authors":"T Place, M Zeitoun","year":"2016","venue":"Log. Methods Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Place and Zeitoun, 2022] T. Place and M. Zeitoun. A generic polynomial time approach to separation by first- order logic without quantifier alternation. In Proc. of FSTTCS, volume 250 of LIPIcs, pages 43:1-43:22, 2022.","title":"A generic polynomial time approach to separation by firstorder logic without quantifier alternation","authors":"T Place, M Zeitoun","year":"2022","venue":"Proc. of FSTTCS","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Prior, 1956] A. Prior. Time and Modality. OUP, 1956.","title":"Time and Modality","authors":"A Prior","year":"1956","venue":null,"doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Raha et al., 2022] R. Raha, R. Roy, N. Fijalkow, and D. Nei- der. Scalable anytime algorithms for learning fragments of linear temporal logic. In Proc. of TACAS, volume 13243 of LNCS, pages 263-280. Springer, 2022.","title":"Scalable anytime algorithms for learning fragments of linear temporal logic","authors":"R Raha, R Roy, N Fijalkow, D Neider","year":"2022","venue":"Proc. of TACAS","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Rizzo et al., 2018] G. Rizzo, N. Fanizzi, C. d'Amato, and F. Esposito. A framework for tackling myopia in concept learning on the web of data. In Proc. of EKAW, pages 338- 354. Springer, 2018.","title":"A framework for tackling myopia in concept learning on the web of data","authors":"G Rizzo, N Fanizzi, C Amato, F Esposito","year":"2018","venue":"Proc. of EKAW","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Rizzo et al., 2020] G. Rizzo, N. Fanizzi, and C. d'Amato. Class expression induction as concept space exploration: From DL-FOIL to DL-FOCL. Future Gener. Comput. Syst., 108:256-272, 2020.","title":"Class expression induction as concept space exploration: From DL-FOIL to DL-FOCL","authors":"G Rizzo, N Fanizzi, C Amato","year":"2020","venue":"Future Gener. Comput. Syst","doi":null,"url":null,"internal_url":null},{"position":51,"raw":"[Ryzhikov et al., 2021] V. Ryzhikov, Y. Savateev, and M. Zakharyaschev. Deciding FO-rewritability of ontology- mediated queries in linear temporal logic. In Proc. of TIME, volume 206 of LIPIcs, pages 10:1-10:15, 2021.","title":"Deciding FO-rewritability of ontologymediated queries in linear temporal logic","authors":"V Ryzhikov, Y Savateev, M Zakharyaschev","year":"2021","venue":"Proc. of TIME","doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[Sarker and Hitzler, 2019] Md. K. Sarker and P. Hitzler. Ef- ficient concept induction for description logics. In Proc. of AAAI, pages 3036-3043, 2019.","title":"Efficient concept induction for description logics","authors":"K Md, P Sarker, Hitzler","year":"2019","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":53,"raw":"[Schaerf, 1993] A. Schaerf. On the complexity of the in- stance checking problem in concept languages with exis- tential quantification. J. Intel. Inf. Sys., 2:265-278, 1993.","title":"On the complexity of the instance checking problem in concept languages with existential quantification","authors":"A Schaerf","year":"1993","venue":"J. Intel. Inf. Sys","doi":null,"url":null,"internal_url":null},{"position":54,"raw":"[Sipser, 1997] M. Sipser. Introduction to the theory of com- putation. PWS Publishing Company, 1997.","title":"Introduction to the theory of computation","authors":"M Sipser","year":"1997","venue":null,"doi":null,"url":null,"internal_url":null},{"position":55,"raw":"[Staworko and Wieczorek, 2012] S. Staworko and P. Wiec- zorek. Learning twig and path queries. In Proc. of ICDT, pages 140-154, 2012.","title":"Learning twig and path queries","authors":"S Staworko, P Wieczorek","year":"2012","venue":"Proc. of ICDT","doi":null,"url":null,"internal_url":null},{"position":56,"raw":"[Straccia and Mucci, 2015] U. Straccia and M. Mucci. pFOIL-DL: Learning (fuzzy) EL concept descriptions from crisp OWL data using a probabilistic ensemble es- timation. In Proc. of SAC, pages 345-352, 2015.","title":"pFOIL-DL: Learning (fuzzy) EL concept descriptions from crisp OWL data using a probabilistic ensemble estimation","authors":"U Straccia, M Mucci","year":"2015","venue":"Proc. of SAC","doi":null,"url":null,"internal_url":null},{"position":57,"raw":"[ten Cate and Dalmau, 2015] B. ten Cate and V. Dalmau. The product homomorphism problem and applications. In Proc. of ICDT, pages 161-176, 2015.","title":"The product homomorphism problem and applications","authors":"Cate Ten, ; B Dalmau, V Cate, Dalmau","year":"2015","venue":"Proc. of ICDT","doi":null,"url":null,"internal_url":null},{"position":58,"raw":"[ten Cate et al., 2022] B. ten Cate, V. Dalmau, M. Funk, and C. Lutz. Extremal fitting problems for conjunctive queries. CoRR, abs/2206.05080, 2022.","title":"Extremal fitting problems for conjunctive queries","authors":"B Cate, V Dalmau, M Funk, C Lutz","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":59,"raw":"[Tran et al., 2017] An C. Tran, J. Dietrich, H. W. Guesgen, and S. Marsland. Parallel symmetric class expression learning. J. Mach. Learn. Res., 18:64:1-64:34, 2017.","title":"Parallel symmetric class expression learning","authors":"Tran","year":"2017","venue":"J. Mach. Learn. Res","doi":null,"url":null,"internal_url":null},{"position":60,"raw":"[Vardi, 2007] M. Vardi. Automata-theoretic techniques for temporal reasoning. In Handbook of Modal Logic, pages 971-989. North-Holland, 2007.","title":"Automata-theoretic techniques for temporal reasoning","authors":"M Vardi","year":"2007","venue":"Handbook of Modal Logic","doi":null,"url":null,"internal_url":null},{"position":61,"raw":"[Weiss and Cohen, 2017] Y. Weiss and S. Cohen. Reverse engineering SPJ-queries from examples. In Proc. of PODS, pages 151-166, 2017.","title":"Reverse engineering SPJ-queries from examples","authors":"Y Weiss, S Cohen","year":"2017","venue":"Proc. of PODS","doi":null,"url":null,"internal_url":null},{"position":62,"raw":"[Willard, 2010] R. Willard. Testing expressibility is hard. In Proc. of CP, vol. 6308 of LNCS, pp. 9-23. Springer, 2010.","title":"Testing expressibility is hard","authors":"R Willard","year":"2010","venue":"Proc. of CP","doi":null,"url":null,"internal_url":null},{"position":63,"raw":"[Zhang et al., 2013] M. Zhang, H. Elmeleegy, C. Procopiuc, and D. Srivastava. Reverse engineering complex join queries. In Proc. of SIGMOD, pages 809-820, 2013.","title":"Reverse engineering complex join queries","authors":"M Zhang, H Elmeleegy, C Procopiuc, D Srivastava","year":"2013","venue":"Proc. of SIGMOD","doi":null,"url":null,"internal_url":null},{"position":64,"raw":"[Zloof, 1977] M. Zloof. Query-by-example: A data base lan- guage. IBM Syst. J., 16(4):324-343, 1977.","title":"Query-by-example: A data base language","authors":"M Zloof","year":"1977","venue":"IBM Syst. J","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}