Inproceedings4018: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Markus Krötzsch (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Markus Krötzsch (Diskussion | Beiträge) K (Textersetzung - „|Forschungsgruppe=Knowledge Systems“ durch „|Forschungsgruppe=Wissensbasierte Systeme“) |
||
| Zeile 18: | Zeile 18: | ||
|Abstract=We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a "left-linear" way in analogy with the well-known procedure for computing the transitive closure of a binary relation. We introduce a notion of left-admissibility for a set of RIAs, which specifies when a subset of RIAs can be used in a left-linear way without loosing consequences, prove a criterion which can be used to effectively check this property, and describe some preliminary experimental results analyzing when the restricted procedure can give practical improvements. | |Abstract=We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a "left-linear" way in analogy with the well-known procedure for computing the transitive closure of a binary relation. We introduce a notion of left-admissibility for a set of RIAs, which specifies when a subset of RIAs can be used in a left-linear way without loosing consequences, prove a criterion which can be used to effectively check this property, and describe some preliminary experimental results analyzing when the restricted procedure can give practical improvements. | ||
|Download=Kazakov-Kroetzsch-Simancik EL-chain-reasoning DL2011.pdf | |Download=Kazakov-Kroetzsch-Simancik EL-chain-reasoning DL2011.pdf | ||
|Forschungsgruppe= | |Forschungsgruppe=Wissensbasierte Systeme | ||
|DOI=http://ceur-ws.org/Vol-745/paper_54.pdf | |DOI=http://ceur-ws.org/Vol-745/paper_54.pdf | ||
}} | }} | ||
Aktuelle Version vom 24. Mai 2016, 18:02 Uhr
Unchain My EL Reasoner
Yevgeny KazakovYevgeny Kazakov, Markus KrötzschMarkus Krötzsch, František SimančíkFrantišek Simančík
Yevgeny Kazakov, Markus Krötzsch, František Simančík
Unchain My EL Reasoner
Proc. 24th International Workshop on Description Logics (DL'11), July 2011. CEUR Workshop Proceedings
Unchain My EL Reasoner
Proc. 24th International Workshop on Description Logics (DL'11), July 2011. CEUR Workshop Proceedings
- KurzfassungAbstract
We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a "left-linear" way in analogy with the well-known procedure for computing the transitive closure of a binary relation. We introduce a notion of left-admissibility for a set of RIAs, which specifies when a subset of RIAs can be used in a left-linear way without loosing consequences, prove a criterion which can be used to effectively check this property, and describe some preliminary experimental results analyzing when the restricted procedure can give practical improvements. - Bemerkung: Note: This paper relates to an early version of the ELK Reasoner. The main reference for ELK is The Incredible ELK. Please use this in citations.
- Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@inproceedings{KKS2011,
author = {Yevgeny Kazakov and Markus Kr{\"{o}}tzsch and Franti{\v{s}}ek
Siman{\v{c}}{\'{\i}}k},
title = {Unchain My {EL} Reasoner},
booktitle = {Proc. 24th International Workshop on Description Logics (DL'11)},
publisher = {CEUR Workshop Proceedings},
year = {2011},
month = {July}
}
