Article3071: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Bartosz Bednarczyk (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Bartosz Bednarczyk (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
Zeile 8: | Zeile 8: | ||
|To appear=0 | |To appear=0 | ||
|Year=2021 | |Year=2021 | ||
|Month=August | |||
|Journal=Information Processing Letters | |Journal=Information Processing Letters | ||
|Volume=169C | |Volume=169C |
Version vom 13. März 2021, 22:15 Uhr
Statistical EL is ExpTime-complete
Bartosz BednarczykBartosz Bednarczyk
Bartosz Bednarczyk
Statistical EL is ExpTime-complete
Information Processing Letters, 169C(106113), August 2021
Statistical EL is ExpTime-complete
Information Processing Letters, 169C(106113), August 2021
- KurzfassungAbstract
We show that the consistency problem for Statistical EL ontologies, defined by Peñaloza and Potyka, is ExpTime-hard. Together with existing ExpTime upper bounds, we conclude ExpTime-completeness of the logic. Our proof goes via a reduction from the consistency problem for EL extended with negation of atomic concepts. - Forschungsgruppe:Research Group: Computational LogicComputational Logic
@article{B2021,
author = {Bartosz Bednarczyk},
title = {Statistical {EL} is {ExpTime-complete}},
journal = {Information Processing Letters},
volume = {169C},
number = {106113},
year = {2021},
month = {August}
}