Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
108
Voted
DLOG
2010
124
views
Automated Reasoning
»
more
DLOG 2010
»
Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes
15 years 28 days ago
Download
www.cs.uwaterloo.ca
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth boun...
Anni-Yasmin Turhan, Rafael Peñaloza
claim paper
Read More »