{"type":"ScholarlyArticle","title":"Description Logics with Pointwise Circumscription","authors":[{"name":"Federica Di Stefano","slug":"federica-di-stefano","given":"Federica","family":"Di Stefano","affiliation":"Institute of Logic and Computation , TU Wien , Austria"},{"name":"Magdalena Ortiz","slug":"magdalena-ortiz","given":"Magdalena","family":"Ortiz","affiliation":"Department of Computing Science , Umeå University , Sweden"},{"name":"Mantas Šimkus","slug":"mantas-simkus","given":"Mantas","family":"Simkus","affiliation":"Department of Computing Science , Umeå University , Sweden"}],"abstract":"Circumscription is one of the most powerful ways to extend Description Logics (DLs) with non-monotonic reasoning features, albeit with huge computational costs and undecidability in many cases. In this paper, we introduce pointwise circumscription for DLs, which is not only intuitive in terms of knowledge representation, but also provides a sound approximation of classic circumscription and has reduced computational complexity. Our main idea is to replace the second-order quantification step of classic circumscription with a series of (pointwise) local checks on all domain elements and their immediate neighbourhood. Our main positive results are for ontologies in DLs ALCIO and ALCI: we prove that for TBoxes of modal depth 1 (i.e. without nesting of existential or universal quantifiers) standard reasoning problems under pointwise circumscription are (co)NExpTime-complete and ExpTime-complete, respectively. The restriction of modal depth still yields a large class of ontologies useful in practice, and it is further justified by a strong undecidability result for pointwise circumscription with general TBoxes in ALCIO.","doi":"10.24963/ijcai.2023/353","url":"https://ijcai.org/proceedings/2023/353","pdf":"https://ijcai.org/proceedings/2023/0353.pdf","markdown":"https://ijcai.org/proceedings/2023/353.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/353","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":353,"pages":{"first":3167,"last":3175},"keywords":["Knowledge Representation and Reasoning: KRR: Description logics and ontologies","Knowledge Representation and Reasoning: KRR: Non-monotonic reasoning"],"videos":[],"references":[{"position":1,"raw":"[Baader and Hollunder, 1995] F. Baader and B. Hollunder. Priorities on defaults with prerequisites, and their applica- tion in treating specificity in terminological default logic. Journal of Automated Reasoning, 15(1):41-68, 1995.","title":"Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic","authors":"F Baader, B Hollunder","year":"1995","venue":"Journal of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baader et al., 2017] F. Baader, I. Horrocks, C. Lutz, and U. Sattler. An Introduction to Description Logic. Cam- bridge University Press, Cambridge, UK, 2017.","title":"An Introduction to Description Logic","authors":"F Baader, I Horrocks, C Lutz, U Sattler","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonatti et al., 2009] Piero A. Bonatti, Carsten Lutz, and Frank Wolter. The complexity of circumscription in de- scription logic. Journal of Artificial Intelligence Research, (35):717-773, September 2009.","title":"The complexity of circumscription in description logic","authors":"A Piero, Carsten Bonatti, Frank Lutz, Wolter","year":"2009","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bonatti et al., 2011] Piero A. Bonatti, Marco Faella, and Luigi Sauro. Defeasible inclusions in low-complexity DLs. J. Artif. Intell. Res., 42:719-764, 2011.","title":"Defeasible inclusions in low-complexity DLs","authors":"A Piero, Marco Bonatti, Luigi Faella, Sauro","year":"2011","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bonatti et al., 2015] Piero A. Bonatti, Marco Faella, Carsten Lutz, Luigi Sauro, and Frank Wolter. Decidability of circumscribed description logics revisited. In Thomas Eiter, Hannes Strass, Miroslaw Truszczynski, and Stefan Woltran, editors, Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation -Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday, volume 9060 of Lecture Notes in Computer Science, pages 112-124. Springer, 2015.","title":"Decidability of circumscribed description logics revisited","authors":"A Piero, Marco Bonatti, Carsten Faella, Luigi Lutz, Frank Sauro, Wolter","year":"2015","venue":"Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation -Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bonatti et al., 2022] P.A. Bonatti, I.M. Petrova, and L. Sauro. Optimizing the computation of overriding in dln. Artificial Intelligence, 311:103764, 2022.","title":"Optimizing the computation of overriding in dln","authors":"P A Bonatti, I M Petrova, L Sauro","year":"2022","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bonatti, 2021] Piero A. Bonatti. Query answering in cir- cumscribed OWL2 profiles. Ann. Math. Artif. Intell., 89(12):1155-1173, 2021.","title":"Query answering in circumscribed OWL2 profiles","authors":"A Piero, Bonatti","year":"2021","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Britz et al., 2021] Katarina Britz, Giovanni Casini, Thomas Meyer, Kody Moodley, Uli Sattler, and Ivan Varzinczak. Principles of KLM-style defeasible description logics. ACM Trans. Comput. Log., 22(1):1:1-1:46, 2021.","title":"Principles of KLM-style defeasible description logics","authors":"Katarina Britz, Giovanni Casini, Thomas Meyer, Kody Moodley, Uli Sattler, Ivan Varzinczak","year":"2021","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Casini et al., 2019] Giovanni Casini, Umberto Straccia, and Thomas Meyer. A polynomial time subsumption algo- rithm for nominal safe ELO ⊥ under rational closure. In- formation Sciences, 501:588-620, 2019.","title":"A polynomial time subsumption algorithm for nominal safe ELO ⊥ under rational closure","authors":"Giovanni Casini, Umberto Straccia, Thomas Meyer","year":"2019","venue":"Information Sciences","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Donini et al., 1998] F.M. Donini, M. Lenzerini, D. Nardi, W. Nutt, and A. Schaerf. An epistemic operator for de- scription logics. Artificial Intelligence, 100(1):225-274, 1998.","title":"An epistemic operator for description logics","authors":"F M Donini, M Lenzerini, D Nardi, W Nutt, A Schaerf","year":"1998","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Giordano et al., 2013] L. Giordano, V. Gliozzi, N. Olivetti, and G.L. Pozzato. A non-monotonic description logic for reasoning about typicality. Artificial Intelligence, 195:165-202, 2013.","title":"A non-monotonic description logic for reasoning about typicality","authors":"L Giordano, V Gliozzi, N Olivetti, G L Pozzato","year":"2013","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gogacz et al., 2020a] Tomasz Gogacz, Víctor Gutiérrez- Basulto, Yazmín Ibáñez-García, Filip Murlak, Mag- dalena Ortiz, and Mantas Simkus. Ontology focusing: Knowledge-enriched databases on demand. In ECAI 2020 -24th European Conference on Artificial Intelligence, vol- ume 325 of Frontiers in Artificial Intelligence and Appli- cations, pages 745-752. IOS Press, 2020.","title":"Ontology focusing: Knowledge-enriched databases on demand","authors":"Gogacz","year":"2020","venue":"ECAI 2020 -24th European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gogacz et al., 2020b] Tomasz Gogacz, Sanja Lukumbuzya, Magdalena Ortiz, and Mantas Simkus. Datalog rewritabil- ity and data complexity of ALCHOIF with closed predi- cates. In Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reason- ing, KR 2020, Rhodes, Greece, September 12-18, 2020, pages 434-444, 2020.","title":"Datalog rewritability and data complexity of ALCHOIF with closed predicates","authors":"Gogacz","year":"2020","venue":"Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lifschitz, 1985] V. Lifschitz. Closed-world databases and circumscription. Artificial Intelligence, 27(2):229-235, 1985.","title":"Closed-world databases and circumscription","authors":"V Lifschitz","year":"1985","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lifschitz, 1986] Vladimir Lifschitz. Pointwise circumscrip- tion: Preliminary report. In Proceedings of the Fifth AAAI National Conference on Artificial Intelligence, AAAI'86, pages 406-410. AAAI Press, 1986.","title":"Pointwise circumscription: Preliminary report","authors":"Vladimir Lifschitz","year":"1986","venue":"Proceedings of the Fifth AAAI National Conference on Artificial Intelligence, AAAI'86","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lin and Zhou, 2011] Fangzhen Lin and Yi Zhou. From an- swer set logic programming to circumscription via logic of GK. Artif. Intell., 175(1):264-277, 2011.","title":"From answer set logic programming to circumscription via logic of GK","authors":"Lin, Zhou ; ] Fangzhen Lin, Yi Zhou","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lutz et al., 2005] Carsten Lutz, Ulrike Sattler, and Lidia Tendera. The complexity of finite model reasoning in description logics. Information and Computation, 199(1):132-171, 2005. 19th International Conference on Automated Deduction (CADE-19).","title":"The complexity of finite model reasoning in description logics","authors":"Carsten Lutz, Ulrike Sattler, Lidia Tendera","year":"2005","venue":"International Conference on Automated Deduction (CADE-19)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[McCarthy, 1980] J. McCarthy. Circumscription-a form of non-monotonic reasoning. Artificial Intelligence, 13(1):27-39, 1980. Special Issue on Non-Monotonic Logic.","title":"Circumscription-a form of non-monotonic reasoning","authors":"J Mccarthy","year":"1980","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[McCarthy, 1986] J. McCarthy. Applications of circumscrip- tion to formalizing common-sense knowledge. Artificial Intelligence, 28(1):89-116, 1986.","title":"Applications of circumscription to formalizing common-sense knowledge","authors":"J Mccarthy","year":"1986","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Németi, 1992] I. Németi. Decidable versions of first order logic and cylindric-relativized set algebras. In CSLI Pub- lications, editor, Logic Colloquium '92, pages 171-241, 1992.","title":"Decidable versions of first order logic and cylindric-relativized set algebras","authors":"I Németi","year":"1992","venue":"Logic Colloquium '92","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Schild, 1991] Klaus Schild. A correspondence theory for terminological logics: Preliminary report. In John My- lopoulos and Raymond Reiter, editors, Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI 1991), pages 466-471.","title":"A correspondence theory for terminological logics: Preliminary report","authors":"Klaus Schild, Schild","year":"1991","venue":"Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI 1991)","doi":null,"url":null,"internal_url":"/proceedings/1991/70"},{"position":22,"raw":"Morgan Kaufmann, 1991.","title":null,"authors":"Morgan Kaufmann","year":"1991","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Tobies, 2000] Stephan Tobies. The complexity of reason- ing with cardinality restrictions and nominals in expres- sive description logics. Journal of Artificial Intelligence Research, (12):199-217, 2000.","title":"The complexity of reasoning with cardinality restrictions and nominals in expressive description logics","authors":"Stephan Tobies","year":"2000","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}