{"type":"ScholarlyArticle","title":"Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies","authors":[{"name":"Maurice Funk","slug":"maurice-funk","given":"Maurice","family":"Funk","affiliation":"Leipzig University , Faculty of Mathematics and Computer Science , Germany"},{"name":"Jean Christoph Jung","slug":"jean-christoph-jung","given":"Jean Christoph","family":"Jung","affiliation":"University of Hildesheim , Institute of Computer Science , Germany"},{"name":"Carsten Lutz","slug":"carsten-lutz","given":"Carsten","family":"Lutz","affiliation":"Leipzig University , Faculty of Mathematics and Computer Science , Germany"}],"abstract":"We study ELI queries (ELIQs) in the presence of ontologies formulated in the description logic DL-Lite. For the dialect DL-LiteH, we show that ELIQs have a frontier (set of least general generalizations) that is of polynomial size and can be computed in polynomial time. In the dialect DL-LiteF, in contrast, frontiers may be infinite. We identify a natural syntactic restriction that enables the same positive results as for DL-LiteH. We use our results on frontiers to show that ELIQs are learnable in polynomial time in the presence of a DL-LiteH / restricted DL-LiteF ontology in Angluin's framework of exact learning with only membership queries.","doi":"10.24963/ijcai.2022/364","url":"https://ijcai.org/proceedings/2022/364","pdf":"https://ijcai.org/proceedings/2022/0364.pdf","markdown":"https://ijcai.org/proceedings/2022/364.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/364","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":364,"pages":{"first":2627,"last":2633},"keywords":["Knowledge Representation and Reasoning: Description Logics and Ontologies"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986624","length_sec":86,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984767","length_sec":353,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Angluin, 1987a] Dana Angluin. Learning regular sets from queries and counterexamples. Inf. Comput., 75(2):87-106, 1987.","title":"Learning regular sets from queries and counterexamples","authors":"Dana Angluin, Angluin","year":"1987","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Angluin, 1987b] Dana Angluin. Queries and concept learning. Mach. Learn., 2(4):319-342, 1987.","title":"Dana Angluin. Queries and concept learning","authors":"Angluin","year":"1987","venue":"Mach. Learn","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Artale et al., 2009] Alessandro Artale, Diego Calvanese, Roman Kontchakov, and Michael Zakharyaschev. The DL-Lite family and relations. J. of Artifical Intelligence Research, 36:1-69, 2009.","title":"The DL-Lite family and relations","authors":"Alessandro Artale, Diego Calvanese, Roman Kontchakov, Michael Zakharyaschev","year":"2009","venue":"J. of Artifical Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baader et al., 1999] Franz Baader, Ralf Küsters, and Ralf Molitor. Computing least common subsumers in description logics with existential restrictions. In Proc. of IJCAI, pages 96-103.","title":"Computing least common subsumers in description logics with existential restrictions","authors":"Baader","year":"1999","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/1999/15"},{"position":5,"raw":"Morgan Kaufmann, 1999.","title":null,"authors":"Morgan Kaufmann","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Baader et al., 2007] Franz Baader, Baris Sertkaya, and Anni- Yasmin Turhan. Computing the least common subsumer w.r.t. a background terminology. J. Appl. Log., 5(3):392-420, 2007.","title":"Computing the least common subsumer w.r.t. a background terminology","authors":"Baader","year":"2007","venue":"J. Appl. Log","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Baader et al., 2017] Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. An Introduction to Description Logics. Cam- bride University Press, 2017.","title":"An Introduction to Description Logics","authors":"Franz Baader, Ian Horrocks, Carsten Lutz, Ulrike Sattler","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Baader et al., 2018] Franz Baader, Francesco Kriegel, Adrian Nu- radiansyah, and Rafael Peñaloza. Making repairs in description logics more gentle. In Proc. of KR, pages 319-328. AAAI Press, 2018.","title":"Making repairs in description logics more gentle","authors":"Franz Baader, Francesco Kriegel, Adrian Nuradiansyah, Rafael Peñaloza","year":"2018","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Baader, 2003] Franz Baader. Least common subsumers and most specific concepts in a description logic with existential restric- tions and terminological cycles. In Proc. of IJCAI, pages 319- 324.","title":"Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles","authors":"Franz Baader, Baader","year":"2003","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2003/47"},{"position":10,"raw":"Morgan Kaufmann, 2003.","title":null,"authors":"Morgan Kaufmann","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bienvenu et al., 2013a] Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus, and Guohui Xiao. Tractable queries for lightweight description logics. In Proc. of IJCAI, pages 768-774, 2013.","title":"Tractable queries for lightweight description logics","authors":"Bienvenu","year":"2013","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/120"},{"position":12,"raw":"[Bienvenu et al., 2013b] Meghyn Bienvenu, Balder ten Cate, Carsten Lutz, and Frank Wolter. Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. In Proc. of PODS, pages 213-224. ACM, 2013.","title":"Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP","authors":"Bienvenu","year":"2013","venue":"Proc. of PODS","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Calvanese et al., 2007] Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning, 39(3):385- 429, 2007.","title":"Tractable reasoning and efficient query answering in description logics: The DL-Lite family","authors":"Calvanese","year":"2007","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Calvanese et al., 2009] Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Antonella Poggi, Mar- iano Rodriguez-Muro, and Riccardo Rosati. Ontologies and databases: The DL-Lite approach. In Reasoning Web, volume 5689 of LNCS, pages 255-356, 2009.","title":"Ontologies and databases: The DL-Lite approach","authors":"Calvanese","year":"2009","venue":"Reasoning Web","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Funk et al., 2019] Maurice Funk, Jean Christoph Jung, Carsten Lutz, Hadrien Pulcini, and Frank Wolter. Learning description logic concepts: When can positive and negative examples be sep- arated? In Proc. of IJCAI, pages 1682-1688, 2019.","title":"Learning description logic concepts: When can positive and negative examples be separated?","authors":"Maurice Funk, Jean, Christoph Jung, Carsten Lutz, Hadrien Pulcini, Frank Wolter","year":"2019","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/233"},{"position":16,"raw":"[Funk et al., 2021] Maurice Funk, Jean Christoph Jung, and Carsten Lutz. Actively learning concept and conjunctive queries under EL r -ontologies. In Proc. of IJCAI, pages 1887-1893, 2021.","title":"Actively learning concept and conjunctive queries under EL r -ontologies","authors":"Maurice Funk, Jean, Christoph Jung, Carsten Lutz","year":"2021","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Funk et al., 2022] Maurice Funk, Jean Christoph Jung, and Carsten Lutz. Frontiers and exact learning of ELI queries under DL-Lite ontologies. CoRR, abs/2204.14172, 2022.","title":"Frontiers and exact learning of ELI queries under DL-Lite ontologies","authors":"Maurice Funk, Jean, Christoph Jung, Carsten Lutz","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Jung et al., 2020a] Jean Christoph Jung, Carsten Lutz, Hadrien Pulcini, and Frank Wolter. Logical separability of incomplete data under ontologies. In Proc. of KR, pages 517-528, 2020.","title":"Logical separability of incomplete data under ontologies","authors":"Jung","year":"2020","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Jung et al., 2020b] Jean Christoph Jung, Carsten Lutz, and Frank Wolter. Least general generalizations in description logic: Verifi- cation and existence. In Proc. of AAAI, pages 2854-2861, 2020.","title":"Least general generalizations in description logic: Verification and existence","authors":"Jung","year":"2020","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kikot et al., 2011] Stanislav Kikot, Roman Kontchakov, and Michael Zakharyaschev. On (in)tractability of OBDA with OWL 2 QL. In Proc. of DL, 2011.","title":"On (in)tractability of OBDA with OWL 2 QL","authors":"Stanislav Kikot, Roman Kontchakov, Michael Zakharyaschev","year":"2011","venue":"Proc. of DL","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Konev et al., 2018] Boris Konev, Carsten Lutz, Ana Ozaki, and Frank Wolter. Exact learning of lightweight description logic on- tologies. J. Mach. Learn. Res., 18(201):1-63, 2018.","title":"Exact learning of lightweight description logic ontologies","authors":"Boris Konev, Carsten Lutz, Ana Ozaki, Frank Wolter","year":"2018","venue":"J. Mach. Learn. Res","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kriegel, 2019] Francesco Kriegel. Constructing and Extending Description Logic Ontologies using Methods of Formal Concept Analysis. PhD thesis, TU Dresden, 2019.","title":"Constructing and Extending Description Logic Ontologies using Methods of Formal Concept Analysis","authors":"Francesco Kriegel","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lehmann and Hitzler, 2010] Jens Lehmann and Pascal Hitzler. Concept learning in description logics using refinement opera- tors. Mach. Learn., 78:203-250, 2010.","title":"Concept learning in description logics using refinement operators","authors":"Hitzler Lehmann, Jens Lehmann, Pascal Hitzler","year":"2010","venue":"Mach. Learn","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Lehmann and Völker, 2014] Jens Lehmann and Johanna Völker. Perspectives on Ontology Learning, volume 18 of Studies on the Semantic Web. IOS Press, 2014.","title":"Perspectives on Ontology Learning","authors":"Völker Lehmann","year":"2014","venue":"Studies on the Semantic Web","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Muggleton, 1991] Stephen Muggleton. Inductive logic program- ming. New Generation Comput., 8(4):295-318, 1991.","title":"Inductive logic programming","authors":"Stephen Muggleton","year":"1991","venue":"New Generation Comput","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Nesetril and Tardif, 2000] Jaroslav Nesetril and Claude Tardif. Duality theorems for finite structures (characterising gaps and good characterisations). J. Comb. Theory, Ser. B, 80(1):80-97, 2000.","title":"Jaroslav Nesetril and Claude Tardif. Duality theorems for finite structures (characterising gaps and good characterisations)","authors":"Tardif Nesetril","year":"2000","venue":"J. Comb. Theory, Ser. B","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[OWL Working Group, 2009] W3C OWL Working Group. OWL 2 Web Ontology Language: Document Overview. W3C Rec- ommendation, 2009. Available at http://www.w3.org/TR/ owl2-overview/.","title":"W3C OWL Working Group. OWL 2 Web Ontology Language: Document Overview. W3C Recommendation","authors":null,"year":"2009","venue":null,"doi":null,"url":"http://www.w3.org/TR/owl2-overview/","internal_url":null},{"position":28,"raw":"[Ozaki et al., 2020] Ana Ozaki, Cosimo Persia, and Andrea Maz- zullo. Learning query inseparable ELH ontologies. In Proc. of AAAI, pages 2959-2966, 2020.","title":"Learning query inseparable ELH ontologies","authors":"Ana Ozaki, Cosimo Persia, Andrea Mazzullo","year":"2020","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Ozaki, 2020] Ana Ozaki. Learning description logic ontologies: Five approaches. where do they stand? KI -Künstliche Intelli- genz, 2020.","title":"Learning description logic ontologies: Five approaches","authors":"Ana Ozaki","year":"2020","venue":"where do they stand? KI -Künstliche Intelligenz","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Plotkin, 1970] Gordon Plotkin. A note on inductive generaliza- tions. Edinburgh University Press, 1970.","title":"A note on inductive generalizations","authors":"Gordon Plotkin","year":"1970","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Sarker and Hitzler, 2019] Md. Kamruzzaman Sarker and Pascal Hitzler. Efficient concept induction for description logics. In Proc. of AAAI, pages 3036-3043, 2019.","title":"Efficient concept induction for description logics","authors":"Md, Kamruzzaman Sarker, Pascal Hitzler","year":"2019","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[ten Cate and Dalmau, 2021] Balder ten Cate and Victor Dalmau. Conjunctive queries: Unique characterizations and exact learn- ability. In Proc. of ICDT, volume 186 of LIPIcs, pages 9:1-9:24. Schloss Dagstuhl -Leibniz-Zentrum für Informatik, 2021.","title":"Balder ten Cate and Victor Dalmau. Conjunctive queries: Unique characterizations and exact learnability","authors":"Dalmau Cate","year":"2021","venue":"Proc. of ICDT","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Zarrieß and Turhan, 2013] Benjamin Zarrieß and Anni-Yasmin Turhan. Most specific generalizations w.r.t. general EL-TBoxes. In Proc. of IJCAI, pages 1191-1197, 2013.","title":"Most specific generalizations w.r.t. general EL-TBoxes","authors":"Turhan Zarrieß, Benjamin Zarrieß, Anni-Yasmin Turhan","year":"2013","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/179"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}