Problem
Research questions and friction points this paper is trying to address.
OWL Class Expressions
Complexity
Interpretability
Reasoning
Syntactic Simplification of OWL Class Expressions
๐ค AI Summary
ๆฌๆๆๅบไบไธ็งๆฐ็็ฎๆณCES๏ผ็จไบ็ฎๅOWL็ฑป่กจ่พพๅผ๏ผ้่ฟๅบ็จ้ๅ่งๅๅๅฐๅไฝๅนถไฟๆ้ป่พไธ่ดๆง๏ผไป่ๆ้ซๆจ็ๆ็ๅๅฏ่ฏปๆงใ
๐ Abstract
Class expression learning often produces complex OWL class expressions that are difficult to interpret and reason over. However, by following theoretically grounded simplification principles, this complexity can be reduced. In this paper, we propose Class Expression Simplifier (CES), a novel algorithm for the syntactic simplification of class expressions in Description Logics (DL). CES aims to preserve formal semantics while reducing representational complexity. It systematically applies rewriting rules to eliminate redundancies and identify simpler yet equivalent expressions, thereby producing more compact and human-readable representations without altering logical entailments. We evaluate the effectiveness of CES on class expressions learned from two medium-sized ontologies, demonstrating measurable improvements in reasoning efficiency and reductions in verbosity. This work contributes to the broader goal of making ontology-driven applications more accessible, maintainable, and scalable, with direct implications for knowledge graph construction, semantic search, and Web-scale reasoning. CES is implemented within the open-source Python framework OWLAPY and is publicly available.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Class Expression Simplifier
syntactic simplification
Description Logics
rewriting rules
reasoning efficiency
๐ Similar Papers
No similar papers found.
