cfaed Publications
Tight Complexity Bounds for Reasoning in the Description Logic$\backslash$ mathcal $\{$BE$\{$$\backslash$ kern-. 1em$}$L$}$
Reference
\.Ismail \.Ilkan Ceylan, Rafael Peñaloza, "Tight Complexity Bounds for Reasoning in the Description Logic$\backslash$ mathcal $\{$BE$\{$$\backslash$ kern-. 1em$}$L$}$", Chapter in Logics in Artificial Intelligence, Springer, pp. 77–91, 2014. [doi]
Bibtex
@incollection{ceylan2014tight,
title={Tight Complexity Bounds for Reasoning in the Description Logic$\backslash$ mathcal $\{$BE$\{$$\backslash$ kern-. 1em$\}$L$\}$},
author={Ceylan, {\.I}smail {\.I}lkan and Pe{\~n}aloza, Rafael},
booktitle={Logics in Artificial Intelligence},
pages={77--91},
year={2014},
publisher={Springer},
doi={10.1007/978-3-319-11558-0}
}
title={Tight Complexity Bounds for Reasoning in the Description Logic$\backslash$ mathcal $\{$BE$\{$$\backslash$ kern-. 1em$\}$L$\}$},
author={Ceylan, {\.I}smail {\.I}lkan and Pe{\~n}aloza, Rafael},
booktitle={Logics in Artificial Intelligence},
pages={77--91},
year={2014},
publisher={Springer},
doi={10.1007/978-3-319-11558-0}
}
Downloads
No Downloads available for this publication
Related Paths
Permalink
https://cfaed.tu-dresden.de/publications?pubId=174