{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T00:33:25Z","timestamp":1792197205150,"version":"4.4.0"},"reference-count":44,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"unspecified","delay-in-days":20,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions. Preferences are combined to define a preferential interpretation in which defeasible inclusions can be evaluated. The construction of the concept-aware multipreference semantics is related to Brewka\u2019s framework for qualitative preferences. We exploit Answer Set Programming (in particular,<jats:italic>asprin<\/jats:italic>) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic \u03be<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1471068420000381_inline1.png\"\/><jats:tex-math>$\\mathcal L_ \\bot ^ + $<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1017\/s1471068420000381","type":"journal-article","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T05:25:42Z","timestamp":1600665942000},"page":"751-766","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":12,"title":["An ASP approach for reasoning in a concept-aware multipreferential lightweight DL"],"prefix":"10.1017","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9445-7770","authenticated-orcid":false,"given":"Laura","family":"Giordano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniele","family":"Theseider Dupr\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2020,9,21]]},"reference":[{"key":"S1471068420000381_ref33","unstructured":"33. Gottlob, G. , Hernich, A. , Kupke, C. , and Lukasiewicz, T. 2014. Stable model semantics for guarded existential rules and description logics. In Proc. 14th Int. Conf. on Principles of Knowledge Representation and Reasoning, KR 2014, Vienna, Austria, July 20-24."},{"key":"S1471068420000381_ref35","unstructured":"35. Knorr, M. , Hitzler, P. , and Maier, F. 2012. Reconciling OWL and non-monotonic rules for the semantic web. In ECAI 2012. 474\u2013479."},{"key":"S1471068420000381_ref24","unstructured":"24. Gil, O. F. 2014. On the Non-Monotonic Description Logic ALC+Tmin CoRR abs\/1404.6566."},{"key":"S1471068420000381_ref26","unstructured":"26. Giordano, L. , Gliozzi, V. , Olivetti, N. , and Pozzato, G. 2013. Minimal Model Semantics and Rational Closure in Description Logics. In 26th International Workshop on Description Logics (DL 2013). Vol. 1014. 168\u2013180."},{"key":"S1471068420000381_ref40","unstructured":"40. Lieto, A. and Pozzato, G. 2018. A description logic of typicality for conceptual combination. In Proc. ISMIS 2018, Cyprus, October 29-31, 2018. LNCS, vol. 11177. Springer, 189\u2013199."},{"key":"S1471068420000381_ref34","first-page":"1","article-title":"The incredible ELK","volume":"1","author":"Kazakov","year":"2014","journal-title":"J. Autom. Reasoning 53"},{"key":"S1471068420000381_ref8","doi-asserted-by":"crossref","unstructured":"8. Bonatti, P. A. , Petrova, I. M. , and Sauro, L. 2015. Optimizing the computation of overriding. In Proc. ISWC 2015. 356\u2013372.","DOI":"10.1007\/978-3-319-25007-6_21"},{"key":"S1471068420000381_ref27","unstructured":"27. Giordano, L. , Gliozzi, V. , Olivetti, N. , and Pozzato, G. L. 2007. Preferential Description Logics. In Proc. LPAR 2007 (14th Conf. on Logic for Programming, Artificial Intelligence, and Reasoning), Dershowitz, N. and Voronkov, A. , Eds. LNAI, vol. 4790. Springer-Verlag, 257\u2013272."},{"key":"S1471068420000381_ref32","unstructured":"32. Gliozzi, V. 2016. Reasoning about multiple aspects in rational closure for DLs. In Proc. AIIA 2016, Genova, Italy, Nov 29 - Dec 1, 2016. LNCS, vol. 10037. 392\u2013405."},{"key":"S1471068420000381_ref9","unstructured":"9. Bozzato, L. , Eiter, T. , and Serafini, L. 2014. Contextualized knowledge repositories with justifiable exceptions. In DL 2014. CEUR Workshop Proceedings, vol. 1193. 112\u2013123."},{"key":"S1471068420000381_ref20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/505372.505373","article-title":"Description logics of minimal knowledge and negation as failure","volume":"2","author":"Donini","year":"2002","journal-title":"ACM Transactions on Computational Logic (ToCL) 3"},{"key":"S1471068420000381_ref23","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1016\/j.artint.2008.04.002","article-title":"Combining answer set programming with description logics for the semantic web","volume":"12","author":"Eiter","year":"2008","journal-title":"Artif. Intell. 172"},{"key":"S1471068420000381_ref2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF00883932","article-title":"Embedding defaults into terminological knowledge representation formalisms","volume":"1","author":"Baader","year":"1995","journal-title":"J. Autom. Reasoning 14"},{"key":"S1471068420000381_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90101-5"},{"key":"S1471068420000381_ref19","unstructured":"19. Deane, G. , Broda, K. , and Russo, A. 2015. Reasoning in the presence of inconsistency through preferential ALC. In 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2015, Suva, Fiji, November 24-28, 2015. 67\u201380."},{"key":"S1471068420000381_ref21","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01536399","article-title":"On the computational cost of disjunctive logic programming: Propositional case","volume":"3","author":"Eiter","year":"1995","journal-title":"Annals of Mathematics and Artificial Intelligence 15"},{"key":"S1471068420000381_ref7","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1613\/jair.2763","article-title":"The Complexity of Circumscription in DLs","author":"Bonatti","year":"2009","journal-title":"Journal of Artificial Intelligence Research (JAIR) 35"},{"key":"S1471068420000381_ref31","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000381"},{"key":"S1471068420000381_ref28","unstructured":"28. Giordano, L. , Gliozzi, V. , Olivetti, N. , and Pozzato, G. L. 2011. Reasoning about typicality in low complexity DLs: the logics Tmin and DL\u2013Litec In Proc. 22nd Int. Joint Conf. on Artificial Intelligence (IJCAI 2011). Morgan Kaufmann, Barcelona, 894\u2013899."},{"key":"S1471068420000381_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.04.001"},{"key":"S1471068420000381_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2017.12.005"},{"key":"S1471068420000381_ref39","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01535841","article-title":"Another perspective on default reasoning","volume":"1","author":"Lehmann","year":"1995","journal-title":"Ann. Math. Artif. Intell. 15,"},{"key":"S1471068420000381_ref17","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1613\/jair.4062","article-title":"Defeasible inheritance-based description logics","author":"Casini","year":"2013","journal-title":"Journal of Artificial Intelligence Research (JAIR) 48"},{"key":"S1471068420000381_ref14","author":"Britz","year":"2008"},{"key":"S1471068420000381_ref41","first-page":"5","article-title":"Reconciling Description Logics and rules","author":"Motik","year":"2010","journal-title":"J. ACM 57"},{"key":"S1471068420000381_ref6","first-page":"719","article-title":"Defeasible inclusions in low-complexity dls","author":"Bonatti","year":"2011","journal-title":"J. Artif. Intell. Res. (JAIR) 42"},{"key":"S1471068420000381_ref22","unstructured":"22. Eiter, T. , Ianni, G. , Lukasiewicz, T. , and Schindlauer, R. 2011. Well-founded semantics for description logic programs in the semantic web. ACM Trans. Comput. Log. 12, 2, 11."},{"key":"S1471068420000381_ref43","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ijar.2018.08.005","article-title":"Reasoning in the defeasible description logic EL- computing standard inferences under rational and relevant semantics","author":"Pensel","year":"2018","journal-title":"J. Approx. Reasoning 103"},{"key":"S1471068420000381_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-017-9571-9"},{"key":"S1471068420000381_ref1","author":"Baader","year":"2005"},{"key":"S1471068420000381_ref12","unstructured":"12. Brewka, G. 2004. A rank based description language for qualitative preferences. In Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI\u20192004, Valencia, Spain, August 22-27, 2004. 303\u2013307."},{"key":"S1471068420000381_ref18","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1016\/j.ins.2018.09.037","article-title":"A polynomial time subsumption algorithm for nominal safe elo under rational closure","author":"Casini","year":"2019","journal-title":"Inf. Sci. 501"},{"key":"S1471068420000381_ref38","unstructured":"38. Lehmann, D. and Magidor, M. 1992. What does a conditional knowledge base entail? Artificial Intelligence 55, 1, 1\u201360."},{"key":"S1471068420000381_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15675-5_21"},{"key":"S1471068420000381_ref13","doi-asserted-by":"crossref","unstructured":"13. Brewka, G. , Delgrande, J. P. , Romero, J. , and Schaub, T. 2015. asprin: Customizing answer set preferences without a headache. In Proc. AAAI 2015. 1467\u20131474.","DOI":"10.1609\/aaai.v29i1.9398"},{"key":"S1471068420000381_ref16","volume":"6341","author":"Casini","year":"2010"},{"key":"S1471068420000381_ref42","unstructured":"42. Pearl, J. 1990. System Z: A Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning. In TARK (3rd Conference on Theoretical Aspects of Reasoning about Knowledge), R. Parikh, Ed. Kaufmann, Morgan , Pacific Grove, CA , USA, 121\u2013135."},{"key":"S1471068420000381_ref15","unstructured":"15. Casini, G. , Meyer, T. , Varzinczak, I. J. ,, and Moodley, K. 2013. Nonmonotonic Reasoning in Description Logics: Rational Closure for the ABox. In 26th International Workshop on Description Logics (DL 2013). CEUR Workshop Proceedings, vol. 1014. 600\u2013615."},{"key":"S1471068420000381_ref11","unstructured":"11. Brewka, G. 1989. Preferred subtheories: An extended logical framework for default reasoning. In Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, MI, USA, August 1989. 1043\u20131048."},{"key":"S1471068420000381_ref29","first-page":"738","article-title":"ASP for minimal entailment in a rational extension of SROEL","volume":"5","author":"Giordano","year":"2016","journal-title":"TPLP 16"},{"key":"S1471068420000381_ref25","doi-asserted-by":"crossref","first-page":"95","DOI":"10.3233\/FI-2018-1659","article-title":"Towards a rational closure for expressive description logics: the case of SHIQ","volume":"1","author":"Giordano","year":"2018","journal-title":"Fundam. Inform. 159"},{"key":"S1471068420000381_ref5","first-page":"1","article-title":"A new semantics for overriding in description logics","author":"Bonatti","year":"2015","journal-title":"Artif. Intell. 222"},{"key":"S1471068420000381_ref44","unstructured":"44. Straccia, U. 1993. Default inheritance reasoning in hybrid KL-ONE-Style Logics. In Proc. 13th Int. Joint Conf. on Artificial Intelligence (IJCAI 1993). Chamb\u00e9ry, France, 676\u2013681."},{"key":"S1471068420000381_ref30","doi-asserted-by":"crossref","first-page":"135","DOI":"10.3233\/FI-2018-1698","article-title":"Defeasible Reasoning in SROEL from Rational Entailment to Rational Closure","volume":"1","author":"Giordano","year":"2018","journal-title":"Fundam. Inform. 161"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068420000381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T08:28:20Z","timestamp":1668846500000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068420000381\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["S1471068420000381"],"URL":"https:\/\/doi.org\/10.1017\/s1471068420000381","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}