liu.seSearch for publications in DiVA
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Logic-based Repairing of Ontologies and Knowledge Graphs
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-1367-9679
2026 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

The Semantic Web aims to make web data machine-readable by embedding semantics into the data. As key technologies in the Semantic Web, ontologies and knowledge graphs (KGs) are used to formalize and represent knowledge in a structured way. They are core components in application scenarios involving searching, integrating, managing, and extracting value from heterogeneous data sources at scale, and are widely used by major data and database providers and consumers, such as Google, Amazon, and Netflix. As a result, their quality is critical for developing high-quality semantically enabled applications. However, in practice, many ontologies and KGs, especially large-scale ones, contain defects. Using such defective resources can lead to incorrect conclusions or missed valid conclusions. Ensuring their quality, particularly in terms of correctness and completeness, is a major challenge. 

In this thesis, we focus on repairing ontologies and KGs represented by description logic knowledge bases. We first discuss the kind of defects concerning correctness and completeness that can occur in ℰℒℋ⟂ ontologies and KGs. We then propose an interactive repairing approach that combines five basic quality-improving operations: debugging, removing, weakening, strengthening, and adding, to address the problem of repairing ℰℒℋ⟂ ontologies and KGs with defects. Traditional debugging approaches repair ontologies and KGs by simply removing incorrect information, which may result in the loss of correct information that was previously derivable from the removed information. In contrast, our approach aims to preserve as much correct knowledge as possible while removing incorrect information by, in addition to removing the incorrect information, also adding correct knowledge, thereby mitigating the negative effects and improving the quality of repaired ontologies and KGs. 

Furthermore, we show that there are also choices to be made when using and combining these operations such as how to combine them and when to apply them, as well as the different autonomy levels of different components in a KG. We define combination operators that reflect these different choices, and discuss how these choices influence the quality of the repaired ontologies and KGs in terms of correctness and completeness. Comparing these different combinations provides insights into how to make choices based on the desired level of correctness and completeness of repaired ontologies and KGs. Finally, we conduct experiments and present several use cases to validate our approach and demonstrate the framework. Overall, this framework serves as a template for developing repair systems with specific properties regarding correctness and completeness of the repaired ontologies and KGs.  

 

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2026. , p. 167
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 2535
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-226711DOI: 10.3384/9789181186185ISBN: 9789181186178 (print)ISBN: 9789181186185 (electronic)OAI: oai:DiVA.org:liu-226711DiVA, id: diva2:2091692
Public defence
2026-09-07, Ada Lovelace, hus B, Campus Valla, Linköping, 09:30 (English)
Opponent
Supervisors
Available from: 2026-08-12 Created: 2026-08-12

Open Access in DiVA

fulltext(11273 kB)112 downloads
File information
File name FULLTEXT01.pdfFile size 11273 kBChecksum SHA-512
56915a95243ed1ae92fb14049563792f04065d232d0a7c3537ba04c7594b1dbc035f1c69a210c20638041cf780568d5dbaf307b874e750cf9067e971f5a6b4a5
Type fulltextMimetype application/pdf
Order online >>

Other links

Publisher's full text

Authority records

Li, Ying

Search in DiVA

By author/editor
Li, Ying
By organisation
Software and SystemsFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 6189 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf