Bidirectional Reachability-Based Modules
نویسندگان
چکیده
We introduce an algorithm for MinA extraction in EL based on bidirectional reachability. We obtain a significant reduction in the size of modules extracted at almost no additional cost to that of extracting standard reachability-based modules. Bidirectional modules are related to nested locality modules, but are aimed specifically at MinA extraction and are generally smaller. For acyclic EL TBoxes consisting of only primitive concept inclusions, all MinAs can be extracted without the need for subsumption testing.
منابع مشابه
Module-theoretic Properties of Reachability Modules for SRIQ
In this paper we investigate the module-theoretic properties of ⊥− and >-reachability modules in terms of inseparability relations for the DL SRIQ. We show that, although these modules are not depleting or self-contained, they share the robustness properties of syntactic locality modules and preserve all justifications for an entailment.
متن کاملFast Hierarchical Test Path Construction for Circuits with DFT-Free Controller-Datapath Interface
Hierarchical approaches address the complexity of test generation through symbolic reachability paths that provide access to the I/Os of each module in a design. However, while transparency behavior suitable for symbolic design traversal can be utilized for constructing reachability paths for datapath modules, control modules do not exhibit transparency. Therefore, incorporating such modules in...
متن کاملA normal form for hypergraph-based module extraction for SROIQ
Modularization is an important part of the modular design and maintenance of large scale ontologies. Syntactic locality modules, with their desirable model theoretic properties, play an ever increasing role in the design of algorithms for modularization, partitioning and reasoning tasks such as classification. It has been shown that, for the DL EL, the syntactic locality module extraction probl...
متن کاملDeciding deadlock-freedom of daisy-chain protocols by fair reachability analysis
A relief strategy called fair reachability analysis [5, 7, 11] is extended for the verification of daisy-chain protocols, which are defined in the communicating finite state machine model as networks of n ≥ 2 processes with a bidirectional, serial link structure. Fair reachability analysis is shown to decide the deadlock detection problem for daisy-chain protocols whose fair reachable global st...
متن کاملAutomating Modular Veri cation ? ; ? ?
Modular techniques for automatic veri cation attempt to overcome the state-explosion problem by exploiting the modular structure naturally present in many system designs. Unlike other tasks in the veri cation of nite-state systems, current modular techniques rely heavily on user guidance. In particular, the user is typically required to construct module abstractions that are neither too detaile...
متن کامل