{"type":"ScholarlyArticle","title":"Extremal Separation Problems for Temporal Instance Queries","authors":[{"name":"Jean Christoph Jung","slug":"jean-christoph-jung","given":"Jean Christoph","family":"Jung","affiliation":"Department of Computer Science , TU Dortmund University , Germany"},{"name":"Vladislav Ryzhikov","slug":"vladislav-ryzhikov","given":"Vladislav","family":"Ryzhikov","affiliation":"School of Computing and Mathematical Sciences , Birkbeck , University of London , 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":"School of Computing and Mathematical Sciences , Birkbeck , University of London , UK"}],"abstract":"The separation problem for a class Q of database queries is to find a query in Q that distinguishes between a given set of ‘positive’ and ‘negative’ data examples. Separation provides explanations of examples and underpins the query-by-example paradigm to support database users in constructing and refining queries. As the space of all separating queries can be large, it is helpful to succinctly represent this space by means of its most specific (logically strongest) and general (weakest) members. We investigate this extremal separation problem for classes of instance queries formulated in linear temporal logic LTL with the operators conjunction, ‘next’, and ‘eventually’. Our results range from tight complexity bounds for verifying and counting extremal separators to algorithms computing them.","doi":"10.24963/ijcai.2024/382","url":"https://ijcai.org/proceedings/2024/382","pdf":"https://ijcai.org/proceedings/2024/0382.pdf","markdown":"https://ijcai.org/proceedings/2024/382.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/382","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":382,"pages":{"first":3448,"last":3456},"keywords":["Multidisciplinary Topics and Applications: MTA: Databases","Knowledge Representation and Reasoning: KRR: Qualitative, geometric, spatial, and temporal reasoning","Knowledge Representation and Reasoning: KRR: Learning and reasoning"],"videos":[],"references":[{"position":1,"raw":"[Abboud et al., 2015] A. Abboud, A. Backurs, and V. V. Williams. Tight hardness results for LCS and other se- quence similarity measures. In Proc. of FOCS, pages 59- 78. IEEE Computer Society, 2015.","title":"Tight hardness results for LCS and other sequence similarity measures","authors":"A Abboud, A Backurs, V V Williams","year":"2015","venue":"Proc. of FOCS","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alexe et al., 2011] B. Alexe, B. ten Cate, Ph. Kolaitis, and W. Ch. Tan. Characterizing schema mappings via data ex- amples. ACM Trans. Database Syst., 36(4):23, 2011.","title":"Characterizing schema mappings via data examples","authors":"B Alexe, B Cate, Ph Kolaitis, W Ch, Tan","year":"2011","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":3,"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":4,"raw":"[Arora and Barak, 2009] S. Arora and B. Barak. Computa- tional Complexity -A Modern Approach. Cambridge Uni- versity Press, 2009.","title":"Computational Complexity -A Modern Approach","authors":"S Arora, B Barak","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"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":6,"raw":"[Baader et al., 2015] F. Baader, S. Borgwardt, and M. Lipp- mann. Temporal query entailment in the description logic SHQ. J. Web Semant., 33:71-93, 2015.","title":"Temporal query entailment in the description logic SHQ","authors":"F Baader, S Borgwardt, M Lippmann","year":"2015","venue":"J. Web Semant","doi":null,"url":null,"internal_url":null},{"position":7,"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":8,"raw":"[Barceló et al., 2021] P. Barceló, A. Baumgartner, V. Dal- mau, and B. Kimelfeld. Regularizing conjunctive features for classification. J. Comput. Syst. Sci., 119:97-124, 2021.","title":"Regularizing conjunctive features for classification","authors":"P Barceló, A Baumgartner, V Dalmau, B Kimelfeld","year":"2021","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":9,"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":10,"raw":"[Blass and Gurevich, 1982] A. Blass and Y. Gurevich. On the unique satisfiability problem. Inf. Control., 55(1- 3):80-88, 1982.","title":"On the unique satisfiability problem","authors":"A Blass, Y Gurevich","year":"1982","venue":"Inf. Control","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Blin et al., 2012] G. Blin, L. Bulteau, M. Jiang, P. Tejada, and S. Vialette. Hardness of longest common subsequence for sequences with bounded run-lengths. In Proc. of CPM, volume 7354 of Lecture Notes in Computer Science, pages 138-148. Springer, 2012.","title":"Hardness of longest common subsequence for sequences with bounded run-lengths","authors":"G Blin, L Bulteau, M Jiang, P Tejada, S Vialette","year":"2012","venue":"Proc. of CPM","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Blum et al., 2021] Ch. Blum, M. Djukanovic, A. Santini, H. Jiang, Chu-Min 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":"Blum","year":"2021","venue":"Comput. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Borgwardt et al., 2015] S. Borgwardt, M. Lippmann, and V. Thost. Temporalizing rewritable query languages over knowledge bases. J. Web Semant., 33:50-70, 2015.","title":"Temporalizing rewritable query languages over knowledge bases","authors":"S Borgwardt, M Lippmann, V Thost","year":"2015","venue":"J. Web Semant","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Camacho and McIlraith, 2019] A. Camacho and Sh. McIl- raith. Learning interpretable models expressed in linear temporal logic. In Proc. of ICAPS, pages 621-630. AAAI Press, 2019.","title":"McIlraith. Learning interpretable models expressed in linear temporal logic","authors":"Mcilraith Camacho, A Camacho, Sh","year":"2019","venue":"Proc. of ICAPS","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Chandra and Merlin, 1977] A. Chandra and P. Merlin. Op- timal implementation of conjunctive queries in relational data bases. In Proc. of STOC, pages 77-90. ACM, 1977.","title":"Optimal implementation of conjunctive queries in relational data bases","authors":"A Chandra, P Merlin","year":"1977","venue":"Proc. of STOC","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Chomicki and Toman, 2018] J. Chomicki and D. Toman. Temporal logic in database query languages. In Ling Liu and M. Tamer Özsu, editors, Encyclopedia of Database Systems, Second Edition. Springer, 2018.","title":"Temporal logic in database query languages","authors":"Toman Chomicki, ] J Chomicki, D Toman","year":"2018","venue":"Encyclopedia of Database Systems, Second Edition","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Chowdhury et al., 2010] R. A. Chowdhury, Hai-Son Le, and V. Ramachandran. Cache-oblivious dynamic program- ming for bioinformatics. IEEE/ACM Trans. on Computa- tional Biology and Bioinformatics, 7(3):495-510, 2010.","title":"Cache-oblivious dynamic programming for bioinformatics","authors":"R A Chowdhury, Hai-Son Le, V Ramachandran","year":"2010","venue":"IEEE/ACM Trans. on Computational Biology and Bioinformatics","doi":null,"url":null,"internal_url":null},{"position":18,"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":19,"raw":"[Cohen and Weiss, 2016] S. Cohen and Y. Y. Weiss. The complexity 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":"S Cohen, Y Y Weiss","year":"2016","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Crochemore et al., 2007] M. Crochemore, Ch. Hancart, and T. Lecroq. Algorithms on strings. Cambridge University Press, 2007.","title":"Algorithms on strings","authors":"M Crochemore, Ch Hancart, T Lecroq","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Cropper et al., 2022] A. Cropper, S. Dumancic, R. Evans, and S. H. Muggleton. Inductive logic programming at 30. Mach. Learn., 111(1):147-172, 2022.","title":"Inductive logic programming at 30","authors":"A Cropper, S Dumancic, R Evans, S H Muggleton","year":"2022","venue":"Mach. Learn","doi":null,"url":null,"internal_url":null},{"position":22,"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":23,"raw":"[Fijalkow and Lagarde, 2021] N. Fijalkow and G. Lagarde. The complexity of learning linear temporal formulas from examples. In Proc. of ICGI, pages 237-250. PMLR, 2021.","title":"The complexity of learning linear temporal formulas from examples","authors":"N Fijalkow, G Lagarde","year":"2021","venue":"Proc. of ICGI","doi":null,"url":null,"internal_url":null},{"position":24,"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":25,"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. In Proc. of IJCAI, pages 3230-3238. ijcai.org, 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":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2023/360"},{"position":26,"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":27,"raw":"[Funk et al., 2019] M. Funk, J.-Ch. 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 - Ch, C Jung, H Lutz, F Pulcini, Wolter","year":"2019","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/233"},{"position":28,"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-ECAI, 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-ECAI","doi":null,"url":null,"internal_url":"/proceedings/2018/255"},{"position":29,"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:103785, 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":30,"raw":"[Jung et al., 2024] J. Ch. Jung, V. Ryzhikov, F. Wolter, and M. Zakharyaschev. Extremal separation problems for tem- poral instance queries. CoRR abs/2405.03511, 2024.","title":"Extremal separation problems for temporal instance queries","authors":"J Ch Jung, V Ryzhikov, F Wolter, M Zakharyaschev","year":"2024","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"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":32,"raw":"[Kimelfeld and Ré, 2018] B. Kimelfeld and Ch. Ré. A rela- tional framework for classifier engineering. ACM Trans. Database Syst., 43(3):11:1-11:36, 2018.","title":"A relational framework for classifier engineering","authors":"B Kimelfeld, Ch Ré","year":"2018","venue":"ACM Trans. Database Syst","doi":null,"url":null,"internal_url":null},{"position":33,"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":34,"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":35,"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":36,"raw":"[Mitchell, 1982] T. Mitchell. Generalization as search. Artif. Intell., 18(2):203-226, 1982.","title":"Generalization as search","authors":"T Mitchell","year":"1982","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":37,"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":38,"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":39,"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 Lecture Notes in Computer Science, 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":40,"raw":"[Sarker et al., 2017] Md. K. Sarker, Ning Xie, D. Doran, M. Raymer, and P. Hitzler. Explaining trained neural networks with semantic web technologies: First steps. In Proc. of NeSy, 2017.","title":"Explaining trained neural networks with semantic web technologies: First steps","authors":"K Md, Sarker, D Ning Xie, M Doran, P Raymer, Hitzler","year":"2017","venue":"Proc. of NeSy","doi":null,"url":null,"internal_url":null},{"position":41,"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":42,"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":43,"raw":"[ten Cate et al., 2023] B. ten Cate, V. Dalmau, M. Funk, and C. Lutz. Extremal fitting problems for conjunctive queries. In Proc. of PODS, pages 89-98. ACM, 2023.","title":"Extremal fitting problems for conjunctive queries","authors":"B Cate, V Dalmau, M Funk, C Lutz","year":"2023","venue":"Proc. of PODS","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Weiss and Cohen, 2017] Y. Y. Weiss and S. Cohen. Re- verse engineering SPJ-queries from examples. In Proc. of PODS, pages 151-166, 2017.","title":"Reverse engineering SPJ-queries from examples","authors":"Y Y Weiss, S Cohen","year":"2017","venue":"Proc. of PODS","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Zhang et al., 2013] M. Zhang, H. Elmeleegy, C. M. Pro- copiuc, 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 M Procopiuc, D Srivastava","year":"2013","venue":"Proc. of SIGMOD","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}