Title
Deciding Subsumers of Least Fixpoint Concepts w.r.t. general EL -TBoxes.
Abstract
In this paper we provide a procedure for deciding subsumptions of the form T |= C v E, where C is an ELUμ-concept, E an ELUconcept and T a general EL-TBox. Deciding such subsumptions can be used for computing the logical difference between general EL-TBoxes. Our procedure is based on checking for the existence of a certain simulation between hypergraph representations of the set of subsumees of C and of E w.r.t. T , respectively. With the aim of keeping the procedure implementable, we provide a detailed construction of such hypergraphs deliberately avoiding the use of intricate automata-theoretic techniques.
Year
Venue
Field
2015
KI
Discrete mathematics,Of the form,Constraint graph,Hypergraph,Fixed point,Mathematics
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
7
3
Name
Order
Citations
PageRank
Shasha Feng100.34
Michel Ludwig234.12
Dirk Walther3103.72