{"type":"ScholarlyArticle","title":"Optimizing the Computation of Overriding in DLN (Extended Abstract)","authors":[{"name":"Piero A. Bonatti","slug":"piero-a-bonatti","given":"Piero A.","family":"Bonatti","affiliation":"Università di Napoli Federico II 2 Inria , Sophia Antipolis , France"},{"name":"Iliana Petrova","slug":"iliana-petrova","given":"Iliana","family":"Petrova","affiliation":"Università di Napoli Federico II 2 Inria , Sophia Antipolis , France"},{"name":"Luigi Sauro","slug":"luigi-sauro","given":"Luigi","family":"Sauro","affiliation":"Università di Napoli Federico II 2 Inria , Sophia Antipolis , France"}],"abstract":"One of the factors that hinder the adoption of nonmonotonic description logics in applications is performance. Even when monotonic and nonmonotonic inferences have the same asymptotic complexity, the implementation of nonmonotonic reasoning may be significantly slower.  The family of nonmonotonic logics DLN is no exception to this behavior.\r\n\r\nWe address this issue by introducing two provably correct and complete optimizations for reasoning in DLN. The first optimization is a module extractor that has the purpose of focusing reasoning on a relevant subset of the knowledge base. The second, called optimistic evaluation, aims at exploiting incremental reasoning in a better way. \r\n    \r\nExtensive experimental evaluation shows that the optimized DLN reasoning is often compatible with interactive query answering, thus bringing nonmonotonic description logics closer to practical applications.","doi":"10.24963/ijcai.2023/771","url":"https://ijcai.org/proceedings/2023/771","pdf":"https://ijcai.org/proceedings/2023/0771.pdf","markdown":"https://ijcai.org/proceedings/2023/771.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/771","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":"Journal Track","track":"Journal Track","number":771,"pages":{"first":6860,"last":6862},"keywords":["Knowledge Representation and Reasoning: KRR: Description logics and ontologies","Knowledge Representation and Reasoning: KRR: Non-monotonic reasoning","Knowledge Representation and Reasoning: KRR: Semantic Web"],"videos":[],"references":[{"position":1,"raw":"[Bonatti and Samarati, 2003] Piero A. Bonatti and Pierangela Samarati. Logics for authorization and security. In Logics for Emerging Applications of Databases, pages 277-323. Springer, 2003.","title":"Logics for authorization and security","authors":"A Piero, Pierangela Bonatti, Samarati","year":"2003","venue":"Logics for Emerging Applications of Databases","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bonatti and Sauro, 2017] Piero A. Bonatti and Luigi Sauro. On the logical properties of the nonmonotonic description logic dl n . Artif. Intell., 248:85-111, 2017.","title":"On the logical properties of the nonmonotonic description logic dl n","authors":"A Piero, Luigi Bonatti, Sauro","year":"2017","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonatti et al., 2010] Piero A. Bonatti, Marco Faella, and Luigi Sauro. EL with default attributes and overriding. In Int. Semantic Web Conf. (ISWC 2010), volume 6496 of LNCS, pages 64-79. Springer, 2010.","title":"EL with default attributes and overriding","authors":"A Piero, Marco Bonatti, Luigi Faella, Sauro","year":"2010","venue":"Int. Semantic Web Conf. (ISWC 2010)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bonatti et al., 2011a] Piero A. Bonatti, Marco Faella, and Luigi Sauro. Adding default attributes to EL++. In Wol- fram Burgard and Dan Roth, editors, AAAI. AAAI Press, 2011.","title":"Adding default attributes to EL++","authors":"Bonatti","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bonatti et al., 2011b] Piero A. Bonatti, Marco Faella, and Luigi Sauro. Defeasible inclusions in low-complexity DLs. J. Artif. Intell. Res. (JAIR), 42:719-764, 2011.","title":"Defeasible inclusions in low-complexity DLs","authors":"Bonatti","year":"2011","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bonatti et al., 2015a] Piero A. Bonatti, Marco Faella, Iliana Petrova, and Luigi Sauro. A new semantics for overriding in description logics. Artif. Intell., 222:1-48, 2015.","title":"A new semantics for overriding in description logics","authors":"Bonatti","year":"2015","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bonatti et al., 2015b] Piero A. Bonatti, Iliana Mineva Petrova, and Luigi Sauro. Optimizing the computation of overriding. In The Semantic Web -ISWC 2015 -14th Inter- national Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part I, pages 356-372, 2015.","title":"Optimizing the computation of overriding","authors":"Bonatti","year":"2015","venue":"The Semantic Web -ISWC 2015 -14th International Semantic Web Conference","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bonatti et al., 2022] Piero Andrea Bonatti, Iliana Mineva Petrova, and Luigi Sauro. Optimizing the computation of overriding in DLN. Artificial Intelligence, 311:103764, 2022.","title":"Optimizing the computation of overriding in DLN","authors":"Andrea Piero, Iliana Mineva Bonatti, Luigi Petrova, Sauro","year":"2022","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bonatti, 2019] Piero A. Bonatti. Rational closure for all de- scription logics. Artif. Intell., 274:197-223, 2019.","title":"Rational closure for all description logics","authors":"A Piero, Bonatti","year":"2019","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Casini and Straccia, 2010] Giovanni Casini and Umberto Straccia. Rational closure for defeasible description log- ics. In Tomi Janhunen and Ilkka Niemelä, editors, JELIA, volume 6341 of Lecture Notes in Computer Science, pages 77-90. Springer, 2010.","title":"Rational closure for defeasible description logics","authors":"Giovanni Casini, Umberto Straccia","year":"2010","venue":"JELIA","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Casini and Straccia, 2013] Giovanni Casini and Umberto Straccia. Defeasible inheritance-based description logics. J. Artif. Intell. Res. (JAIR), 48:415-473, 2013.","title":"Defeasible inheritance-based description logics","authors":"Giovanni Casini, Umberto Straccia","year":"2013","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Casini et al., 2013] Giovanni Casini, Thomas Meyer, Kody- lan Moodley, and Ivan José Varzinczak. Towards practical defeasible reasoning for description logics. In Thomas Eiter, Birte Glimm, Yevgeny Kazakov, and Markus Krötzsch, editors, Description Logics, volume 1014 of CEUR Workshop Proceedings, pages 587-599. CEUR- WS.org, 2013.","title":"Towards practical defeasible reasoning for description logics","authors":"Casini","year":"2013","venue":"CEUR Workshop Proceedings","doi":null,"url":null,"internal_url":null},{"position":13,"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. Inf. Sci., 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":"Inf. Sci","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Donini et al., 2002] Francesco M. Donini, Daniele Nardi, and Riccardo Rosati. Description logics of minimal knowledge and negation as failure. ACM Trans. Comput. Log., 3(2):177-225, 2002.","title":"Description logics of minimal knowledge and negation as failure","authors":"Francesco M Donini, Daniele Nardi, Riccardo Rosati","year":"2002","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Giordano et al., 2009] Laura Giordano, Nicola Olivetti, Valentina Gliozzi, and Gian Luca Pozzato. ALC + T: a preferential extension of description logics. Fundam. In- form., 96(3):341-372, 2009.","title":"ALC + T: a preferential extension of description logics","authors":"Laura Giordano, Nicola Olivetti, Valentina Gliozzi, Gian Luca Pozzato","year":"2009","venue":"Fundam. Inform","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Giordano et al., 2013] Laura Giordano, Valentina Gliozzi, Nicola Olivetti, and Gian Luca Pozzato. A non-monotonic description logic for reasoning about typicality. Artif. In- tell., 195:165-202, 2013.","title":"A non-monotonic description logic for reasoning about typicality","authors":"Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Giordano et al., 2015] Laura Giordano, Valentina Gliozzi, Nicola Olivetti, and Gian Luca Pozzato. Semantic char- acterization of rational closure: From propositional logic to description logics. Artif. Intell., 226:1-33, 2015.","title":"Semantic characterization of rational closure: From propositional logic to description logics","authors":"Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato","year":"2015","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Pensel, 2019] Maximilian Pensel. A Lightweight Defeasi- ble Description Logic in Depth. PhD thesis, TU Dresden, 2019.","title":"A Lightweight Defeasible Description Logic in Depth","authors":"Maximilian Pensel","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}