Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3688671.3688766acmotherconferencesArticle/Chapter ViewAbstractPublication PagessetnConference Proceedingsconference-collections
research-article

Detecting and Fixing Inconsistency of Large Knowledge Graphs

Published: 27 December 2024 Publication History

Abstract

Modern Knowledge Graphs (KG) are typically constructed via automated workflows that mine information from vast amounts of, often heterogeneous, resources. Such KG are typically large and also contain formal inconsistencies, i.e. assertions that induce conflicts when combined with given axioms. Such formal inconsistencies hinder the application of classical Description Logics reasoners, as no meaningful results can be obtained by reasoning. Classical reasoners can be used with such KG to retrieve explanations for the inconsistencies, however as the KG size grows larger, the time required for this operation increases dramatically. In this paper we put forward an open-source system for detecting and fixing formal inconsistencies in large real-world knowledge graphs. We integrate and extend the state-of-the-art for parallel KG inconsistency detection and fixing in a single framework. The empirical evaluation of our method on variants of the LUBM dataset reveals its potential for effective inconsistency detection and fixing in large KG.

References

[1]
B. Abu-Salih. 2021. Domain-specific knowledge graphs: A survey. J. Comput. Netw. Commun. 185 (2021).
[2]
S. Ahmetaj, R. David, A. Polleres, and M. Šimkus. 2022. Repairing SHACL Constraint Violations Using Answer Set Programming. In ISWC 2022. Vol. 13489 LNCS. 375–391.
[3]
A. Arioua and A. Bonifati. 2018. User-guided Repairing of Inconsistent Knowledge Bases. EDBT (2018), 133–144.
[4]
H. Arnaout, D. Stepanova, S. Razniewski, and G. Weikum. 2022. Utilizing Language Model Probes for Knowledge Graph Repair. In WWW ’22 Companion, Vol. 1. ACM.
[5]
F. Baader, P. Koopmann, F. Kriegel, and A. Nuradiansyah. 2022. Optimal ABox Repair w.r.t. Static EL TBoxes: From Quantified ABoxes Back to ABoxes. In ESWC 2022, Vol. 3263. 130–146.
[6]
M. Bienvenu. 2020. A short survey on inconsistency handling in ontology-mediated query answering. KI-Künstliche Intelligenz 34, 4 (2020), 443–451.
[7]
M. Bienvenu, C. Bourgaux, and F. Goasdoue. 2016. Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases. AAAI-’16’ (Feb. 2016).
[8]
P. A. Bonatti, A. Hogan, A. Polleres, and L. Sauro. 2011. Robust and scalable Linked Data reasoning incorporating provenance and trust annotations. J. Web Semant. 9, 2 (jul 2011), 165–201.
[9]
A. Bordes, N. Usunier, A. Garcia-Duran, J. Weston, and O. Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. Advances in neural information processing systems (2013), 1–9.
[10]
H. Chen, S. Deng, W. Zhang, Z. Xu, J. Li, and E. Kharlamov. 2021. Neural symbolic reasoning with knowledge graphs: Knowledge extraction, relational reasoning, and inconsistency checking. Fund. Research 1, 5 (2021), 565–573.
[11]
Xiaojun Chen, Shengbin Jia, and Yang Xiang. 2020. A review: Knowledge reasoning over knowledge graph. Expert Systems with Applications 141 (mar 2020), 112948.
[12]
T. de Groot, J. Raad, and S. Schlobach. 2021. Analysing Large Inconsistent Knowledge Graphs Using Anti-patterns. In ESWC 2021. Springer, 40–56.
[13]
C. Demir, D. Moussallem, S. Heindorf, and A.-C. Ngonga Ngomo. 2021. Convolutional Hypercomplex Embeddings for Link Prediction. In 13th Asian Conference on Machine Learning, PMLR.
[14]
W. Fan, P. Lu, C. Tian, and J. Zhou. 2019. Deducing certain fixes to graphs. In VLDB, Vol. 7:12. 752–765.
[15]
J. Frey, L.-P. Meyer, F. Brei, S. Gründer-Fahrer, and M. Martin. 2024. Assessing the evolution of LLM capabilities for knowledge graph engineering in 2023. In ESWC-’24. 26–30.
[16]
B. Glimm, I. Horrocks, B. Motik, G. Stoilos, and Z. Wang. 2014. HermiT: An OWL 2 Reasoner. Journal of Automated Reasoning 53, 3 (oct 2014), 245–269.
[17]
Y. Guo, Z. Pan, and J. Heflin. 2005. LUBM: A benchmark for OWL knowledge base systems. J. Web Semant. 3, 2-3 (2005), 158–182.
[18]
M. Horridge, B. Parsia, and U. Sattler. 2009. Explaining Inconsistencies in OWL Ontologies. In Scalable Uncertainty Management. Springer Berlin Heidelberg, 124–137.
[19]
I. Horrocks, B. Motik, and Z. Wang. 2012. The hermit owl reasoner. Journal of Automated Reasoning 858, 3 (2012).
[20]
Z. Huang, F. Van Harmelen, and A. Ten Teije. 2005. Reasoning with inconsistent ontologies. IJCAI (2005), 454–459.
[21]
S. Ji, S. Pan, E. Cambria, P. Marttinen, and P. S. Yu. 2022. A Survey on Knowledge Graphs: Representation, Acquisition, and Applications. IEEE Transactions on Neural Networks and Learning Systems 33, 2 (2022), 494–514.
[22]
N. Lao and W. W. Cohen. 2010. Relational retrieval using a combination of path-constrained random walks. Machine Learning 81, 1 (oct 2010), 53–67.
[23]
F. Lecue. 2020. On the role of knowledge graphs in explainable AI. Semantic Web 11, 1 (2020), 41–51.
[24]
D. Lembo, M. Lenzerini, R. Rosati, M. Ruzzi, and D. F. Savo. 2015. Inconsistency-tolerant query answering in ontology-based data access. Journal of Web Semantics 33 (2015), 3–29.
[25]
Y. Ma, P. Hitzler, and Z. Lin. 2007. Algorithms for paraconsistent reasoning with OWL. In ESWC-’07. Springer, 399–413.
[26]
C. Meilicke, D. Ruffinelli, A. Nolle, H. Paulheim, and H. Stuckenschmidt. 2017. Fast ABox consistency checking using incomplete reasoning and caching. In RuleML+ RR 2017. Springer, 168–183.
[27]
A. Melo and H. Paulheim. 2020. Automatic detection of relation assertion errors and induction of relation constraints. Semantic Web 11, 5 (aug 2020), 801–830.
[28]
H. Paulheim. 2016. Knowledge graph refinement: A survey of approaches and evaluation methods. Semantic Web 8, 3 (dec 2016), 489–508. https://www.medra.org/servlet/aliasResolver?alias=iospress&doi=10.3233/SW-160218
[29]
H. Paulheim and C. Bizer. 2014. Improving the quality of linked data using statistical distributions. Int. Journal on Semantic Web and Information Systems (IJSWIS) 10, 2 (2014), 63–86.
[30]
H. Paulheim and A. Gangemi. 2015. Serving DBpedia with DOLCE–more than just adding a cherry on top. In The Semantic Web-ISWC 2015. Springer, 180–196.
[31]
H. Paulheim and H. Stuckenschmidt. 2016. Fast approximate a-box consistency checking using machine learning. In ESWC 2016. Springer, 135–150.
[32]
T. Pellissier Tanon, C. Bourgaux, and F. Suchanek. 2019. Learning How to Correct a Knowledge Base from the Edit History. In ACM Web Conference. ACM, New York, NY, USA, 1465–1475.
[33]
M. Pensel and A. Y. Turhan. 2018. Reasoning in the Defeasible Description Logic \(\mathcal {EL}_{\perp }\)—computing standard inferences under rational and relevant semantics. International Journal of Approximate Reasoning 103 (2018), 28–70.
[34]
A. Senaratne. 2023. SEKA: Seeking Knowledge Graph Anomalies. In Companion Proc. of the ACM Web Conference 2023. ACM, 568–572.
[35]
B. Suntisrivaraporn, G. Qi, Q. Ji, and P. Haase. 2008. A modularization-based approach to finding all justifications for OWL DL entailments. In ASWC 2008, Bangkok, Thailand, Dec. 8-11, 2008. Proceedings. 3. Springer, 1–15.
[36]
T.-K. Tran, M. H. Gad-Elrab, D. Stepanova, E. Kharlamov, and J. Strötgen. 2020. Fast computation of explanations for inconsistency in large-scale knowledge graphs. In Proc. of The Web Conference 2020. 2613–2619.
[37]
J. Wijsen. 2005. Database repairing using updates. ACM Transactions on Database Systems 30, 3 (sep 2005), 722–768.

Index Terms

  1. Detecting and Fixing Inconsistency of Large Knowledge Graphs

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    SETN '24: Proceedings of the 13th Hellenic Conference on Artificial Intelligence
    September 2024
    437 pages
    ISBN:9798400709821
    DOI:10.1145/3688671
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 27 December 2024

    Check for updates

    Author Tags

    1. Knowledge Graphs
    2. Inconsistency
    3. Formal Reasoning

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    SETN 2024

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 11
      Total Downloads
    • Downloads (Last 12 months)11
    • Downloads (Last 6 weeks)11
    Reflects downloads up to 04 Feb 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    Full Text

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media