Modularity through inseparability : algorithms, extensions, and evaluation
Module extraction is the task of computing, given a description logic ontology and a signature ∑ of interest, a subset (called a module) such that for certain applications that only concern ∑ the ontology can be equivalently replaced by the module. In most applications of module extraction it is des...
Main Author: | Gatens, W. A. |
---|---|
Published: |
University of Liverpool
2017
|
Subjects: | |
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.722075 |
Similar Items
-
Active model combination : an evaluation and extension of bagging and boosting for time series forecasting
by: Barrow, Devon K.
Published: (2012) -
Extension of Problem Solving Methods to Recognition
by: Balman, T.
Published: (1977) -
Relational extensions to feature logic : applications to constraint based grammars
by: Manandhar, S. K.
Published: (1994) -
Re-evaluation of illuminant estimation algorithms in terms of reproduction results and failure cases
by: Zakizadeh, Roshanak
Published: (2017) -
GECAF : a generic and extensible framework for developing context-aware smart environments
by: Sabagh, Angham
Published: (2011)