Deciding inseparability and conservative extensions in the description logic <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi mathvariant="script">E</mml:mi><mml:mi mathvariant="script">L</mml:mi></mml:math>-Reference-Cited by-同舟云学术

Deciding inseparability and conservative extensions in the description logic EL

Published:2010-02 Issue:2 Volume:45 Page:194-228
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Lutz Carsten,Wolter Frank

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference25 articles.

1. A note on the refinement of ontologies;Antoniou;International Journal of Intelligent Systems,2000

2. The Description Logic Handbook;Baader,2007

3. Baader, F., Brandt, S., Lutz, C., 2005a. Pushing the EL envelope. LTCS-Report LTCS-05-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html

4. Pushing the EL envelope;Baader,2005

5. Computing least common subsumers in description logics with existential restrictions;Baader,1999

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

1. Involving cognitive science in model transformation for description logics;Logic Journal of the IGPL;2024-08-06

2. Efficient Computation of Signature-Restricted Views for Semantic Web Ontologies;Proceedings of the ACM Web Conference 2024;2024-05-13

3. Inconsistency- and Error-Tolerant Reasoning w.r.t. Optimal Repairs of $$\mathcal{E}\mathcal{L}^\bot $$ Ontologies;Lecture Notes in Computer Science;2024

4. FaithEL: Strongly TBox Faithful Knowledge Base Embeddings for $$\mathcal{E}\mathcal{L}$$;Lecture Notes in Computer Science;2024

5. Focus Set Semantic Differences;Proceedings of the 12th Knowledge Capture Conference 2023;2023-12-05