{"type":"ScholarlyArticle","title":"Ontology Approximation in Horn Description Logics","authors":[{"name":"Anneke Bötcher","slug":"anneke-botcher","given":"Anneke","family":"Bötcher","affiliation":"University of Bremen , Germany"},{"name":"Carsten Lutz","slug":"carsten-lutz","given":"Carsten","family":"Lutz","affiliation":"University of Bremen , Germany"},{"name":"Frank Wolter","slug":"frank-wolter","given":"Frank","family":"Wolter","affiliation":"University of Liverpool , UK"}],"abstract":"We study the approximation of a description logic (DL) ontology in a\r\nless expressive DL, focusing on the case of Horn DLs. It is common\r\nto construct such approximations in an ad hoc way in practice and\r\nthe resulting incompleteness is typically neither analyzed nor \r\nunderstood. In this paper, we show how to construct complete\r\napproximations. These are typically infinite or of excessive size\r\nand thus cannot be used directly in applications, but our results\r\nprovide an important theoretical foundation that enables informed\r\ndecisions when constructing incomplete approximations in practice.","doi":"10.24963/ijcai.2019/218","url":"https://ijcai.org/proceedings/2019/218","pdf":"https://ijcai.org/proceedings/2019/0218.pdf","markdown":"https://ijcai.org/proceedings/2019/218.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/218","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":218,"pages":{"first":1574,"last":1580},"keywords":["Knowledge Representation and Reasoning: Description Logics and Ontologies","Knowledge Representation and Reasoning: Knowledge Representation Languages"],"videos":[],"references":[{"position":1,"raw":"[Baader et al., 2005] Franz Baader, Sebastian Brandt, and Carsten Lutz. Pushing the EL envelope. In Proc. of IJ- CAI, pages 364-369.","title":"Pushing the EL envelope","authors":"Baader","year":"2005","venue":"Proc. of IJ-CAI","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"Morgan Kaufmann, 2005.","title":null,"authors":"Morgan Kaufmann","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baader et al., 2008] Franz Baader, Carsten Lutz, and Sebas- tian Brandt. Pushing the EL envelope further. In Proc. of OWLED, volume 496 of CEUR Workshop Proceedings. CEUR-WS.org, 2008.","title":"Pushing the EL envelope further","authors":"Baader","year":"2008","venue":"CEUR Workshop Proceedings. CEUR-WS.org","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baader et al., 2017] Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. An Introduction to Description Logic. Cambridge University Press, 2017.","title":"An Introduction to Description Logic","authors":"Baader","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Beklemishev, 2014] Lev D. Beklemishev. Positive provabil- ity logic for uniform reflection principles. Ann. Pure Appl. Logic, 165(1):82-105, 2014.","title":"Positive provability logic for uniform reflection principles","authors":"Lev D Beklemishev","year":"2014","venue":"Ann. Pure Appl. Logic","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bienvenu et al., 2016] Meghyn Bienvenu, Peter Hansen, Carsten Lutz, and Frank Wolter. First order-rewritability and containment of conjunctive queries in Horn descrip- tion logics. In Proc. of IJCAI, pages 965-971. AAAI Press, 2016.","title":"First order-rewritability and containment of conjunctive queries in Horn description logics","authors":"Bienvenu","year":"2016","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/141"},{"position":7,"raw":"[Blackburn et al., 2001] Patrick Blackburn, Maarten de Ri- jke, and Yde Venema. Modal Logic. Cambridge Univer- sity Press, 2001.","title":"Modal Logic","authors":"Patrick Blackburn, Maarten De Rijke, Yde Venema","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Botoeva et al., 2010] Elena Botoeva, Diego Calvanese, and Mariano Rodriguez-Muro. Expressive approximations in DL-Lite ontologies. In Proc. of AIMSA, pages 21-31. Springer, 2010.","title":"Expressive approximations in DL-Lite ontologies","authors":"Elena Botoeva, Diego Calvanese, Mariano Rodriguez-Muro","year":"2010","venue":"Proc. of AIMSA","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Brandt et al., 2002] Sebastian Brandt, Rralf Küsters, and Anni-Yasmin Turhan. Approximation and difference in description logics. In Proc. of KR, pages 203-214.","title":"Approximation and difference in description logics","authors":"Sebastian Brandt, Rralf Küsters, Anni-Yasmin Turhan","year":null,"venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Mor- gan Kaufman, 2002.","title":null,"authors":"Morgan Kaufman","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Carral et al., 2014] David Carral, Cristina Feier, Bernardo Cuenca Grau, Pascal Hitzler, and Ian Hor- rocks. EL-ifying ontologies. In Proc. of IJCAR, pages 464-479, 2014.","title":"EL-ifying ontologies","authors":"David Carral, Cristina Feier, Bernardo Cuenca Grau, Pascal Hitzler, Ian Horrocks","year":"2014","venue":"Proc. of IJCAR","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Darwiche and Marquis, 2002] Adnan Darwiche and Pierre Marquis. A knowledge compilation map. J. Artif. Intell. Res., 17(1):229-264, 2002.","title":"A knowledge compilation map","authors":"Adnan Darwiche, Pierre Marquis","year":"2002","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Goldblatt, 1989] R. Goldblatt. Varieties of complex alge- bras. Ann. Pure Appl. Logic, 44(3):173-242, 1989.","title":"Varieties of complex algebras","authors":"R Goldblatt","year":"1989","venue":"Ann. Pure Appl. Logic","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Groot et al., 2005] Perry Groot, Heiner Stuckenschmidt, and Holger Wache. Approximating description logic clas- sification for semantic web reasoning. In Proc. of ESWC, pages 318-332. Springer, 2005.","title":"Approximating description logic classification for semantic web reasoning","authors":"Perry Groot, Heiner Stuckenschmidt, Holger Wache","year":"2005","venue":"Proc. of ESWC","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Jackson, 2004] Marcel Jackson. Semilattices with closure. Algebra Universalis, 52(1):1-37, 2004.","title":"Marcel Jackson. Semilattices with closure","authors":"Jackson","year":"2004","venue":"Algebra Universalis","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kikot et al., 2017] Stanislav Kikot, Ágnes Kurucz, Yoshi- hito Tanaka, Frank Wolter, and Michael Zakharyaschev. Kripke completeness of strictly positive modal logics over meet-semilattices with operators. CoRR, abs/1708.03403, 2017.","title":"Kripke completeness of strictly positive modal logics over meet-semilattices with operators","authors":"Stanislav Kikot, Ágnes Kurucz, Yoshihito Tanaka, Frank Wolter, Michael Zakharyaschev","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Konev et al., 2016] Boris Konev, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. Conservative rewritability of description logic TBoxes. In Proc. of IJ- CAI, pages 1153-1159. AAAI Press, 2016.","title":"Conservative rewritability of description logic TBoxes","authors":"Boris Konev, Carsten Lutz, Frank Wolter, Michael Zakharyaschev","year":"2016","venue":"Proc. of IJ-CAI","doi":null,"url":null,"internal_url":"/proceedings/2016/167"},{"position":18,"raw":"[Konev et al., 2018] Boris Konev, Carsten Lutz, Ana Ozaki, and Frank Wolter. Exact learning of lightweight descrip- tion logic ontologies. J. Mach. Learn. Res., 18(201):1-63, 2018.","title":"Exact learning of lightweight description logic ontologies","authors":"Konev","year":"2018","venue":"J. Mach. Learn. Res","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kontchakov and Zakharyaschev, 2014] Roman Kontchakov and Michael Zakharyaschev. An introduction to descrip- tion logics and query rewriting. In Proc. of RW, volume 8714 of LNCS, pages 195-244. Springer, 2014.","title":"Roman Kontchakov and Michael Zakharyaschev. An introduction to description logics and query rewriting","authors":"Zakharyaschev Kontchakov","year":"2014","venue":"Proc. of RW","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Krötzsch et al., 2013] Markus Krötzsch, Sebastian Rudolph, and Pascal Hitzler. Complexities of Horn description logics. ACM Trans. Comput. Log., 14(1):2:1- 2:36, 2013.","title":"Complexities of Horn description logics","authors":"Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler","year":"2013","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lutz and Wolter, 2010] Carsten Lutz and Frank Wolter. De- ciding inseparability and conservative extensions in the description logic EL. J. Symb. Comput., 45(2):194-228, 2010.","title":"Deciding inseparability and conservative extensions in the description logic EL","authors":"Wolter Lutz, Carsten Lutz, Frank Wolter","year":"2010","venue":"J. Symb. Comput","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lutz et al., 2011] Carsten Lutz, Robert Piro, and Frank Wolter. Description logic TBoxes: Model-theoretic char- acterizations and rewritability. In Proc. of IJCAI, pages 983-988. IJCAI/AAAI, 2011.","title":"Description logic TBoxes: Model-theoretic characterizations and rewritability","authors":"Carsten Lutz, Robert Piro, Frank Wolter","year":"2011","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/169"},{"position":23,"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 Proc. of KR, pages 286-296. AAAI Press, 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":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Pan and Thomas, 2007] Jeff Z. Pan and Edward Thomas. Approximating OWL-DL ontologies. In Proc. of AAAI, pages 1434-1439. AAAI Press, 2007.","title":"Approximating OWL-DL ontologies","authors":"Jeff Z Pan, Edward Thomas","year":"2007","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Ren et al., 2010] Yuan Ren, Jeff Z. Pan, and Yuting Zhao. Soundness preserving approximation for TBox reasoning. In Proc. of AAAI, pages 351-356. AAAI Press, 2010.","title":"Soundness preserving approximation for TBox reasoning","authors":"Jeff Z Yuan Ren, Yuting Pan, Zhao","year":"2010","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Schaerf and Cadoli, 1995] Marco Schaerf and Marco Cadoli. Tractable reasoning via approximation. Artificial Intelligence, 74(2):249 -310, 1995.","title":"Tractable reasoning via approximation","authors":"Marco Schaerf, Marco Cadoli","year":"1995","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Selman and Kautz, 1996] Bart Selman and Henry A. Kautz. Knowledge compilation and theory approximation. J. ACM, 43(2):193-224, 1996.","title":"Knowledge compilation and theory approximation","authors":"Kautz Selman, Bart Selman, Henry A Kautz","year":"1996","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"Viorica Sofronie- Stokkermans. Locality and applications to subsumption testing in EL and some of its extensions. Sci. Ann. Comp. Sci., 23(2):251-284, 2013.","title":"Locality and applications to subsumption testing in EL and some of its extensions","authors":"Viorica Sofronie-Stokkermans","year":"2013","venue":"Sci. Ann. Comp. Sci","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"Viorica Sofronie- Stokkermans. Representation theorems and locality for subsumption testing and interpolation in the de- scription logics EL and EL + and their extensions with n-ary roles and numerical domains. Fundam. Inform., 156(3-4):361-411, 2017.","title":"Representation theorems and locality for subsumption testing and interpolation in the description logics EL and EL + and their extensions with n-ary roles and numerical domains","authors":"Viorica Sofronie-Stokkermans","year":"2017","venue":"Fundam. Inform","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[van Benthem, 1984] Johan van Benthem. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 167-247.","title":"Correspondence theory","authors":"Van Benthem","year":"1984","venue":"Handbook of Philosophical Logic","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}