351 research outputs found
Algorithms for Measuring Similarity Between ELH Concept Descriptions: A Case Study on Snomed ct
In Description Logics, subsumption is regarded as one of the most prominent reasoning services. It 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 given. In several realistic Semantic Web applications, knowing the level of similarity between two concepts, though lacking the subsumption relationship, is beneficial. 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. Two algorithms are devised based on the known homomorphism-based structural subsumption characterization. The first algorithm employs the top-down approach, whereas the second is carried out in the reverse direction. A bottom-up algorithm has better efficiency, making it more suitable to large-scale ontologies developed using an inexpressive DL in the EL family, such as the renowned medical ontology Snomed ct. The computational performance of the proposed measure is intensively studied, and interesting findings in Snomed ct are reported
When are description logic knowledge bases indistinguishable?
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queries is fundamental for many KB engineering and maintenance tasks including versioning, module extraction, knowledge exchange and forgetting. We study the combined and data complexity of this inseparability problem for fragments of Horn-ALCHI, including the description logics underpinning OWL 2 QL and OWL 2 EL
Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures
In a recent research paper, we have proposed an extension of the lightweight Description Logic (DL) EL in which concepts can be defined in an approximate way. To this purpose, the notion of a graded membership function m, which instead of a Boolean membership value 0 or 1 yields a membership degree from the interval [0; 1], was introduced. Threshold concepts can then, for example, require that an individual belongs to a concept C with degree at least 0:8. Reasoning in the threshold DL T EL(m) obtained this way of course depends on the employed graded membership function m. The paper defines a specific such function, called deg, and determines the exact complexity of reasoning in T EL(deg). In addition, it shows how concept similarity measures (CSMs) ~ satisfying certain properties can be used to define graded membership functions m~, but it does not investigate the complexity of reasoning in the induced threshold DLs T EL(m~). In the present paper, we start filling this gap. In particular, we show that computability of ~ implies decidability of T EL(m~), and we introduce a class of CSMs for which reasoning in the induced threshold DLs has the same complexity as in T EL(deg)
Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution
Consider the problem of verifying security properties of a cryptographic
protocol coded in C. We propose an automatic solution that needs neither a
pre-existing protocol description nor manual annotation of source code. First,
symbolically execute the C program to obtain symbolic descriptions for the
network messages sent by the protocol. Second, apply algebraic rewriting to
obtain a process calculus description. Third, run an existing protocol analyser
(ProVerif) to prove security properties or find attacks. We formalise our
algorithm and appeal to existing results for ProVerif to establish
computational soundness under suitable circumstances. We analyse only a single
execution path, so our results are limited to protocols with no significant
branching. The results in this paper provide the first computationally sound
verification of weak secrecy and authentication for (single execution paths of)
C code
Module extraction for inexpressive description logics
Module extraction is an important reasoning task, aiding in the design, reuse and maintenance
of ontologies. Reasoning services such as subsumption testing and MinA extraction have been
shown to bene t from module extraction methods. Though various syntactic traversal-based
module extraction algorithms exist for extracting modules, many only consider the subsumee
of a subsumption statement as a selection criterion for reducing the axioms in the module.
In this dissertation we extend the bottom-up reachability-based module extraction heuristic
for the inexpressive Description Logic EL, by introducing a top-down version of the heuristic
which utilises the subsumer of a subsumption statement as a selection criterion to minimize
the number of axioms in a module. Then a combined bidirectional heuristic is introduced
which uses both operands of a subsumption statement in order to extract very small modules.
We then investigate the relationship between MinA extraction and bidirectional reachabilitybased
module extraction. We provide empirical evidence that bidirectional reachability-based
module extraction for subsumption entailments in EL provides a signi cant reduction in the
size of modules for almost no additional costs in the running time of the original algorithms.Computer ScienceM. Sc. (Computer Science
- …