Yevgeny Kazakov

The Incredible ELK

Abstractℰℒ

Abstraction Refinement for Ontology Materialization

mathcal {E} mathcal {L}

Goal-Directed Tracing of Inferences in EL Ontologies

is a simple tractable Description Logic that features conjunctions and existential restrictions. Due to its favorable computational properties and relevance to existing ontologies, ℰℒ

Scalable Reasoning by Abstraction Beyond DL-Lite

mathcal {E} mathcal {L}

Enumerating Justifications Using Resolution

has become the language of choice for terminological reasoning in biomedical applications, and has formed the basis of the OWL EL profile of the Web ontology language OWL. This paper describes ELK—a high performance reasoner for OWL EL ontologies—and details various aspects from theory to implementation that make ELK one of the most competitive reasoning systems for ℰℒ

ELK Reasoner: Architecture and Evaluation.

mathcal {E} mathcal {L}

Practical reasoning with nominals in the EL family of description logics

ontologies available today.

OWL Reasoner Evaluation (ORE) Workshop 2013 Results: Short Report.

We present a new procedure for ontology materialization (computing all entailed instances of every atomic concept) in which reasoning over a large ABox is reduced to reasoning over a smaller abstract ABox. The abstract ABox is obtained as the result of a fixed-point computation involving two stages: 1) abstraction: partition the individuals into equivalence classes based on told information and use one representative individual per equivalence class, and 2) refinement: iteratively split (refine) the equivalence classes, when new assertions are derived that distinguish individuals within the same class. We prove that the method is complete for Horn

Experimenting with ELK Reasoner on Android.

mathcal{ALCHOI}

Advancing ELK: Not Only Performance Matters.

ontologies, that is, all entailed instances will be derived once the fixed-point is reached. We implement the procedure in a new database-backed reasoning system and evaluate it empirically on existing ontologies with large ABoxes. We demonstrate that the obtained abstract ABoxes are significantly smaller than the original ones and can be computed with few refinement steps.