
一种基于图的DL-Lite本体最小不可满足保持子集的计算方法
A Graph-Based Approach for Calculating Minimal Unsatisfiability-Preserving Subsets of Ontology in DL-Lite
{{custom_ref.label}} |
{{custom_citation.content}}
{{custom_citation.annotation}}
|
/
〈 |
|
〉 |