Tractable approximate deduction for OWL-Reference-Cited by-同舟云学术

Tractable approximate deduction for OWL

Published:2016-06 Issue: Volume:235 Page:95-155
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Pan Jeff Z.^ORCID,Ren Yuan,Zhao Yuting

Funder

Engineering and Physical Sciences Research Council

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference84 articles.

1. Pushing the EL envelope;Baader,2005

2. F. Baader, S. Brandt, C. Lutz, Pushing the EL envelope further, in: K. Clark, P.F. Patel-Schneider (Eds.), Proceedings of the OWLED 2008 DC Workshop on OWL: Experiences and Directions.

3. The Description Logic Handbook: Theory, Implementation, and Applications,2003

4. F. Baader, C. Lutz, B. Suntisrivaraporn, Is tractable reasoning in extensions of the description logic EL useful in practice?, in: Proceedings of the Methods for Modalities Workshop (M4M-05), Berlin, Germany.

5. Solving time-dependent planning problems;Boddy,1989

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A multipurpose TNM stage ontology for cancer registries;Journal of Biomedical Semantics;2022-02-22

2. Implementing Large-Scale ABox Materialization Using Subgraph Reasoning;Knowledge Science, Engineering and Management;2022

3. SUMA: A Partial Materialization-Based Scalable Query Answering in OWL 2 DL;Data Science and Engineering;2021-01-19

4. A Knowledge Graph Based Approach to Social Science Surveys;Data Intelligence;2021

5. Schema aware iterative Knowledge Graph completion;Journal of Web Semantics;2020-12