Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
JELIA
/
Paper
Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$.
Ismail Ilkan Ceylan
,
Rafael Pealoza
Venue
B
JELIA
Year
2014
Proceedings
JELIA
DBLP record
conf/jelia/CeylanP14 ↗
Browse the full
JELIA paper archive
.