A Structural Subsumption based Similarity Measure for the Description Logic ALEH

  title={A Structural Subsumption based Similarity Measure for the Description Logic ALEH},
  author={Boontawee Suntisrivaraporn and Suwan Tongphu},
Description Logics (DLs) are a family of logic-based knowledge representation formalisms, which can be used to develop ontologies in a formally well-founded way. The standard reasoning service of subsumption has proved indispensable in ontology design and maintenance. This checks, relative to the logical definitions in the ontology, whether one concept is more general/specific than another. When no subsumption relationship is identified, however, no information about the two concepts can be… 

Figures and Tables from this paper

Inherited Properties of ℱ_0 Concept Similarity Measure Under Preference Profile

This paper provides proofs of theorems about their inherited properties including their relationship to the classical reasoning problem of concept equivalence, as well as introducing recently introduced measures to identify such kind of similarity degree between concept descriptions.

Concept Similarity under the Agent's Preferences for the Description Logic FL0 with Unfoldable TBox

Concept similarity refers to human judgment of a degree to which a pair of concepts is similar. Computational techniques attempting to imitate such judgment are called concept similarity measures. In

Concept Similarity Under the Agent's Preferences for the Description Logic $\mathcal {A}\!\mathcal {L}\!\mathcal {E}\!\mathcal {H}$

This work introduces a computational approach to concept similarity for the description logic that computes the degree of similarity between two concept descriptions structurally under the agent’s preferences based on the logical definitions defined in an ontology.



A Similarity Measure for the Description Logic EL with Unfoldable Terminologies

  • B. Suntisrivaraporn
  • Computer Science
    2013 5th International Conference on Intelligent Networking and Collaborative Systems
  • 2013
This work presents a new notion of semantic similarity which stems from the known homomorphism-based structural subsumption algorithm and computes a numerical degree of similarity between two EL concept descriptions despite not being in the subsumption relation.

Similarity measures for FL0 concept descriptions from an automata-theoretic point of view

The proposed concept of semantic similarity measures for the language FL0 computes a numerical degree of similarity between two FL0 concept descriptions w.r.t. unfoldable terminologies.

Algorithms for Measuring Similarity Between ELH Concept Descriptions: A Case Study on Snomed ct

This work introduces a new method for measuring the degree of similarity between two concept descriptions in the DL ELH, despite not being in a subsumption relation, using the known homomorphism-based structural subsumption characterization.

A Framework for Semantic-based Similarity Measures for ELH-Concepts

This paper develops a framework for similarity measures for ELH concept descriptions based on the semantics of the DL ELH, and shows that the measures resulting from instantiations fulfill fundamental properties, such as equivalence invariance, yet the framework provides the flexibility to adjust measures to specifics of the modelled domain.

On Desirable Properties of the Structural Subsumption-Based Similarity Measure

The similarity measure for DL \(\mathcal {ELH}\), which is inspired by the homomorphism-based structural subsumption characterization, has been introduced and desirable properties for concept similarity measure are checked and compared with those previously reported in other classical works.

The Description Logic Handbook: Theory, Implementation, and Applications

This new edition of The Description Logic Handbook provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications.

A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts

Similarity measures for concepts written in Description Logics are often devised based on the syntax of concepts or simply by adjusting them to a set of instance data without taking the semantics of the concepts into account.

Computing Least Common Subsumers in Description Logics with Existential Restrictions

The main new contribution of this paper is the treatment of description logics with existential restrictions, based on an appropriate representation of concept descriptions by certain trees, and a characterization of subsumption by homomorphisins between these trees.

Semantic Matching: Algorithms and Implementation

We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each

Matching in Description Logics with Existential Restrictions

This work presents sound and complete decision algorithms for the solvability of matching problems and for computing sets of matchers for matching problems in description logics with existential restrictions.