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
151
click to vote
KR
2010
Springer
230
views
Automated Reasoning
»
more
KR 2010
»
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics
15 years 7 months ago
Download
lat.inf.tu-dresden.de
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
Rafael Peñaloza, Baris Sertkaya
claim paper
Read More »