OWL Reasoning: Subsumption Test Hardness and Modularity
- Submitting institution
-
The University of Manchester
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 85211417
- Type
- D - Journal article
- DOI
-
10.1007/s10817-017-9414-8
- Title of journal
- Journal of Automated Reasoning
- Article number
- -
- First page
- 385
- Volume
- 60
- Issue
- 4
- ISSN
- 0168-7433
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
A - Computer Science
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- "Classification is an important, complex task for ontology engineering. It was commonly believed that modules can be used to simplify core classification sub-tasks - and therefore were used in established reasoners (e.g. Chainsaw, More).
This paper shows that this is not the case, overturning many years of research in the community.
Keynotes:
- Extended Semantic Web Conference 2020
- International Symposium on Frontiers of Combining Systems
- TABLEAUX 2019
This work led to a position as Senior Semantic Web Developer at EBI for postdoc (Matentzoglu)."
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
