The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
From MaRDI portal
Publication:2352492
DOI10.1007/s10817-013-9296-3zbMath1331.68216OpenAlexW55962619WikidataQ56989090 ScholiaQ56989090MaRDI QIDQ2352492
František Simančík, Markus Krötzsch, Yevgeny Kazakov
Publication date: 2 July 2015
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-013-9296-3
Related Items
Memory-limited model-based diagnosis, The Bayesian ontology language \(\mathcal {BEL}\), Data repair of inconsistent nonmonotonic description logic programs, Sequential model-based diagnosis by systematic search, The OWL reasoner evaluation (ORE) 2015 competition report, On combining ontologies and rules, A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure, An ASP approach for reasoning in a concept-aware multipreferential lightweight DL, Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \), An Automata View to Goal-Directed Methods, Reasoning within fuzzy OWL 2 EL revisited, ReAD: AD-based modular ontology classification, Finding good proofs for description logic entailments using recursive quality measures, Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes, Enhancing probabilistic model checking with ontologies, Efficient Reasoning for Inconsistent Horn Formulae, Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\), Connection-minimal abduction in \(\mathcal{EL}\) via translation to FOL, Evonne: interactive proof visualization for description logics (system description), HermiT: an OWL 2 reasoner
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tractable extensions of the description logic \({\mathcal{EL}}\) with numerical datatypes
- Foundations of information and knowledge systems. 7th international symposium, FoIKS 2012, Kiel, Germany, March 5--9, 2012. Proceedings
- Automata-based axiom pinpointing
- Incremental classification of description logics ontologies
- Computing the least common subsumer w.r.t. a background terminology
- Partition-based logical reasoning for first-order and propositional theories
- Debugging incoherent terminologies
- Optimizing terminological reasoning for expressive description logics
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics
- Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic
- Cheap Boolean Role Constructors for Description Logics
- PEER-TO-PEER REASONING FOR INTERLINKED ONTOLOGIES
- Hypertableau Reasoning for Description Logics
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- OWL 2 Profiles: An Introduction to Lightweight Ontology Languages
- The Description Logic Handbook