cfaed Publications

Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$

Reference

\.Ismail \.Ilkan Ceylan, Rafael Peñaloza, "Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$" , In Proceeding: Logics in Artificial Intelligence, Springer Science + Business Media, vol. 8761, pp. 77-91, 2014. [doi]

Bibtex

@inproceedings{ceylan14_tight_compl_bound_reason_descr_logic,
DATE_ADDED = {Thu Sep 29 08:42:37 2016},
author = {{\.I}smail {\.I}lkan Ceylan and Rafael Pe{\~n}aloza},
booktitle = {Logics in Artificial Intelligence},
doi = {10.1007/978-3-319-11558-0_6},
pages = {77-91},
publisher = {Springer Science + Business Media},
series = {Lecture Notes in Artificial Intelligence},
volume = {8761},
title = {Tight Complexity Bounds for Reasoning in the Description Logic
$\mathcal{BE{\kern-.1em}L}$},
url = {http://dx.doi.org/10.1007/978-3-319-11558-0_6},
year = {2014},
}

Downloads

No Downloads available for this publication

Related Paths

Resilience Path

Permalink

https://cfaed.tu-dresden.de/publications?pubId=1234


Go back to publications list