Most Specific Generalizations w.r.t. General EL-TBoxes
暂无分享,去创建一个
[1] Anni-Yasmin Turhan,et al. Optimizations for the Role-Depth Bounded Least Common Subsumer in EL+ , 2012, OWLED.
[2] Franz Baader. A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL , 2004, WG.
[3] S. Griffis. EDITOR , 1997, Journal of Navigation.
[4] Rafael Peñaloza,et al. A Practical Approach for Computing Generalization Inferences in EL\mathcal{EL} , 2011, ESWC.
[5] Carsten Lutz,et al. Deciding inseparability and conservative extensions in the description logic EL , 2010, J. Symb. Comput..
[6] Robert Piro,et al. Enriching EL-Concepts with Greatest Fixpoints , 2010, ECAI 2010.
[7] Franz Baader,et al. Computing the Least Common Subsumer w.r.t. a Background Terminology , 2004, Description Logics.
[9] Ralf Küsters,et al. Approximating most specific concepts in description logics with existential restrictions , 2002, AI Commun..
[10] Franz Baader. Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles , 2003, IJCAI.
[11] Ralf Küsters,et al. Computing Least Common Subsumers in Description Logics with Existential Restrictions , 1999, IJCAI.
[12] Franz Baader,et al. Pushing the EL Envelope , 2005, IJCAI.
[13] Franz Baader,et al. Computing the Least Common Subsumer w.r.t. a Background Terminology , 2004, Description Logics.
[14] Sherri de Coronado,et al. NCI Thesaurus: A semantic model integrating cancer-related clinical and molecular information , 2007, J. Biomed. Informatics.
[15] Diego Calvanese,et al. The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.