Defeasible RDFS via rational closure
Casini G., Straccia U.
Defeasible reasoning Artificial Intelligence Rational closure Logic in Computer Science (cs.LO) Non-monotonic reasoning Information Systems and Management Control and Systems Engineering FOS: Computer and information sciences Artificial Intelligence (cs.AI) Computer Science Applications Theoretical Computer Science RDFS Computer Science - Logic in Computer Science Software Computer Science - Artificial Intelligence
In the field of non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as a notable approach. In recent years, RC has gained popularity in the context of Description Logics (DLs), the logic underpinning the standard semantic Web Ontology Language OWL 2, whose main ingredients are classes, the relationship among classes and roles, which are used to describe the properties of classes. In this work, we show instead how to integrate RC within the triple language RDFS (Resource Description Framework Schema), which together with OWL 2 is a major standard semantic web ontology language. To do so, we start from rdf, a minimal, but significant RDFS fragment that covers the essential features of RDFS, and then extend it to rdf_\bot, allowing to state that two entities are incompatible/disjoint with each other. Eventually, we propose defeasible rdf_\bot via a typical RC construction allowing to state default class/property inclusions. Furthermore, to overcome the main weaknesses of RC in our context, i.e., the "drowning problem" (viz. the "inheritance blocking problem"), we further extend our construction by leveraging Defeasible Inheritance Networks (DIN) defining a new non-monotonic inference relation that combines the advantages of both (RC and DIN). To the best of our knowledge this is the first time of such an attempt. In summary, the main features of our approach are: (i) the defeasible rdf_\bot we propose here remains syntactically a triple language by extending it with new predicate symbols with specific semantics; (ii) the logic is defined in such a way that any RDFS reasoner/store may handle the new predicates as ordinary terms if it does not want to take account of the extra non-monotonic capabilities; (iii) the defeasible entailment decision procedure is built on top of the rdf_\bot entailment decision procedure, which in turn is an extension of the one for rdf via some additional inference rules favouring a potential implementation; (iv) the computational complexity of deciding entailment in rdf and rdf_\bot are the same; and (v) defeasible entailment can be decided via a polynomial number of calls to an oracle deciding ground triple entailment in rdf_\bot and, in particular, deciding defeasible entailment can be done in polynomial time.
Source: Information sciences 643 (2023). doi:10.1016/j.ins.2022.11.165
Publisher: Elsevier [etc.], Boston [etc.], Paesi Bassi
[2] Anastasia Analyti, Grigoris Antoniou, and Carlos Viegas Dama´sio. A formal theory for modular ERDF ontologies. In Axel Polleres and Terrance Swift, editors, Web Reasoning and Rule Systems, Third International Conference, RR 2009, Chantilly, VA, USA, October 25-26, 2009, Proceedings, volume 5837 of Lecture Notes in Computer Science, pages 212-226. Springer, 2009.
[3] Anastasia Analyti, Grigoris Antoniou, and Carlos Viegas Dama´sio. Mweb: A principled framework for modular web rule bases and its semantics. ACM Trans. Comput. Log., 12(2):17:1-17:46, 2011.
[4] Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Dama´sio, and Ioannis Pachoulakis. A framework for modular ERDF ontologies. Ann. Math. Artif. Intell., 67(3-4):189-249, 2013.
[5] Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Dama´sio, and Gerd Wagner. Stable model theory for extended RDF ontologies. In Yolanda Gil, Enrico Motta, V. Richard Benjamins, and Mark A. Musen, editors, The Semantic Web - ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6-10, 2005, Proceedings, volume 3729 of Lecture Notes in Computer Science, pages 21-36. Springer, 2005.
[6] Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Dama´sio, and Gerd Wagner. Extended RDF as a semantic foundation of rule markup languages. J. Artif. Intell. Res., 32:37-94, 2008.
[7] Anastasia Analyti, Carlos Viegas Dama´sio, and Grigoris Antoniou. Extended RDF: computability and complexity issues. Annals of Mathematics and Artificial Intelligence, 75(3-4):267-334, 2015.
[8] G. Antoniou. Nonmonotonic rule systems on top of ontology layers. In Proceedings of the 1st International Semantic Web Conference (ISWC-02), volume 2663 of Lecture Notes in Computer Science, pages 394-398, Sardinia, Italia, 2002. Springer Verlag.
[9] Grigoris Antoniou, Sotiris Batsakis, Raghava Mutharaju, Jeff Z. Pan, Guilin Qi, Ilias Tachmazidis, Jacopo Urbani, and Zhangquan Zhou. A survey of large-scale reasoning on the web of data. Knowledge Eng. Review, 33:e21, 2018.
[10] Grigoris Antoniou, Sotiris Batsakis, and Ilias Tachmazidis. Large-scale reasoning with (semantic) data. In Rajendra Akerkar, Nick Bassiliades, John Davies, and Vadim Ermolayev, editors, 4th International Conference on Web Intelligence, Mining and Semantics (WIMS 14), WIMS '14, Thessaloniki, Greece, June 2-4, 2014, pages 1:1-1:3. ACM, 2014.
[16] Elisa Bertino, Alessandro Provetti, and Franco Salvetti. Local closed-world assumptions for reasoning about semantic web data. In Francesco Buccafurri, editor, 2003 Joint Conference on Declarative Programming, AGP-2003, Reggio Calabria, Italy, September 3-5, 2003, pages 314-323, 2003.
[18] Andreas Billig. A triple-oriented approach for integrating higher-order rules and external contexts. In Diego Calvanese and Georg Lausen, editors, Web Reasoning and Rule Systems, Second International Conference, RR 2008, Karlsruhe, Germany, October 31-November 1, 2008. Proceedings, volume 5341 of Lecture Notes in Computer Science, pages 214-221. Springer, 2008.
[19] P. A. Bonatti, M. Faella, I. Petrova, and L. Sauro. A new semantics for overriding in description logics. Artificial Intelligence Journal, 222:1-48, 2015.
[20] P.A. Bonatti. Rational closure for all description logics. Artificial Intelligence, 274:197 - 223, 2019.
[21] R. Booth and J. B. Paris. A note on the rational closure of knowledge bases with both positive and negative knowledge. J. of Logic, Lang. and Inf., 7(2):165-190, 1998.
[22] K. Britz, G. Casini, T. Meyer, K. Moodley, U. Sattler, and I. Varzinczak. Rational defeasible reasoning for description logics. Technical report, University of Cape Town, South Africa. URL: https://tinyurl.com/yc55y7ts, 2017.
[23] G. Casini, T. Meyer, K. Moodley, and R. Nortje´. Relevant closure: A new form of defeasible reasoning for description logics. In E. Ferme´ and J. Leite, editors, Proceedings of the 14th European Conference on Logics in Artificial Intelligence (JELIA-14), volume 8761 of LNCS, pages 92-106. Springer, 2014.
[24] G. Casini, T. Meyer, K. Moodley, and I. Varzinczak. Nonmonotonic reasoning in description logics: Rational closure for the abox. In Proceedings of the 26th International Workshop on Description Logics (DL-13), pages 600-615, 2013.
[25] G. Casini and U. Straccia. Rational closure for defeasible description logics. In T. Janhunen and I. Niemela¨, editors, Proceedings of the 12th European Conference on Logics in Artificial Intelligence (JELIA-10), number 6341 in LNCS, pages 77-90. Springer-Verlag, 2010.
[26] G. Casini and U. Straccia. Defeasible inheritance-based description logics. Journal of Artificial Intelligence Research, 48:415-473, 2013.
[27] Giovanni Casini, Thomas Andreas Meyer, Kodylan Moodley, Uli Sattler, and Ivan Jose´ Varzinczak. Introducing defeasibility into OWL ontologies. In The Semantic Web - ISWC 2015 - 14th International Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part II, pages 409-426, 2015.
[28] Giovanni Casini and Umberto Straccia. Defeasible inheritance-based description logics. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11), pages 813-818. AAAI Press/International Joint Conferences on Artificial Intelligence, 2011.
[39] L. Giordano, V. Gliozzi, N. Olivetti, and G. L. Pozzato. A non-monotonic description logic for reasoning about typicality. Artificial Intelligence Journal, 195:165-202, 2013.
[40] L. Giordano, V. Gliozzi, N. Olivetti, and G. L. Pozzato. Minimal models for rational closure in SHIQ. In Proceedings of the 15th Italian Conference on Theoretical Computer Science (ICTCS14), CEUR Workshop Proceedings, pages 271-277, 2014.
[41] L. Giordano, V. Gliozzi, N. Olivetti, and G. L. Pozzato. Rational closure in SHIQ. In Proceedings of the 27th International Workshop on Description Logics (DL-14), CEUR Workshop Proceedings, pages 543-555, 2014.
[42] L. Giordano, V. Gliozzi, N. Olivetti, and G. L. Pozzato. Semantic characterization of rational closure: From propositional logic to description logics. Artificial Intelligence Journal, 226:1-33, 2015.
[43] L. Giordano, N. Olivetti, V. Gliozzi, and G. L. Pozzato. A minimal model semantics for nonmonotonic reasoning. In L. Farin˜ as del Cerro, A. Herzig, and J. Mengin, editors, Proceedings of the 13th European Conference on Logics in Artificial Intelligence (JELIA-12), number 7519 in LNCS, pages 228-241. Springer, 2012.
[44] L. Giordano, N. Olivetti, V. Gliozzi, and G. L. Pozzato. Minimal model semantics and rational closure in description logics. In Proceedings of the 26th International Workshop on Description Logics (DL-13), pages 168-180, 2013.
[54] Efstratios Kontopoulos, Nick Bassiliades, and Grigoris Antoniou. A visualization algorithm for defeasible logic rule bases over RDF data. In Massimo Marchiori, Jeff Z. Pan, and Christian de Sainte Marie, editors, Web Reasoning and Rule Systems, First International Conference, RR 2007, Innsbruck , Austria, June 7-8, 2007, Proceedings, volume 4524 of Lecture Notes in Computer Science, pages 367-369. Springer, 2007.
[68] Judea Pearl. System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning. In Proceedings of the 3rd conference on Theoretical Aspects of Reasoning about Knowledge (TARK-90), pages 121-135, San Francisco, CA, USA, 1990. Morgan Kaufmann Publishers Inc.
[69] M. Pensel and A. Y. Turhan. Including quantification in defeasible reasoning for the description logic el⊥. In Marcello Balduccini and Tomi Janhunen, editors, Logic Programming and Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017, Espoo, Finland, July 3-6, 2017, Proceedings, volume 10377 of Lecture Notes in Computer Science, pages 78-84. Springer, 2017.
[70] M. Pensel and A. Y. Turhan. Making quantification relevant again - the case of defeasible EL⊥. In Richard Booth, Giovanni Casini, and Ivan Jose´ Varzinczak, editors, Proceedings of the 4th International Workshop on Defeasible and Ampliative Reasoning (DARe-17) co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017), Espoo, Finland, July 3, 2017., volume 1872 of CEUR Workshop Proceedings, pages 44-57. CEURWS.org, 2017.
[72] Thu-Le Pham, Muhammad Intizar Ali, and Alessandra Mileo. C-ASP: continuous asp-based reasoning over RDF streams. In Marcello Balduccini, Yuliya Lierler, and Stefan Woltran, editors, Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Philadelphia, PA, USA, June 3-7, 2019, Proceedings, volume 11481 of Lecture Notes in Computer Science, pages 45-50. Springer, 2019.
Metrics
Back to previous page
@article{oai:it.cnr:prodotti:482094,
title = {Defeasible RDFS via rational closure},
author = {Casini G. and Straccia U.},
publisher = {Elsevier [etc.], Boston [etc.], Paesi Bassi},
doi = {10.1016/j.ins.2022.11.165 and 10.48550/arxiv.2007.07573},
journal = {Information sciences},
volume = {643},
year = {2023}
}
0000-0002-4267-4447
