共 50 条
- [1] Computing the least common subsumer in the description Logic εL w.r.t. terminological cycles with descriptive semantics [J]. CONCEPTUAL STRUCTURES FOR KNOWLEDGE CREATION AND COMMUNICATION, 2003, 2746 : 117 - 130
- [2] A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in EL w.r.t. Hybrid TBoxes [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5293 : 311 - 323
- [3] Computing the least common subsumer in description logic FLEN [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2010, 47 (06): : 1053 - 1059
- [4] Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely [J]. STATIC ANALYSIS, 2010, 6337 : 271 - +
- [5] Computing Compliant Anonymisations of Quantified ABoxes w.r.t. EL Policies [J]. SEMANTIC WEB - ISWC 2020, PT I, 2020, 12506 : 3 - 20
- [6] Computing Optimal Repairs of Quantified ABoxes w.r.t. Static EL TBoxes [J]. AUTOMATED DEDUCTION, CADE 28, 2021, 12699 : 309 - 326
- [7] Deciding Subsumers of Least Fixpoint Concepts w.r.t. general εL-TBoxes [J]. KI 2015: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2015, 9324 : 59 - 71
- [8] Designing Distributed Systems w.r.t. Conformance [J]. 2015 22ND ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE (APSEC 2015), 2015, : 104 - 110
- [10] Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions [J]. KI-98: ADVANCES IN ARTIFICIAL INTELLIGENCE, 1998, 1504 : 129 - 140