Tractable approximate deduction for OWL
- Submitting institution
-
University of Aberdeen
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 70223856
- Type
- D - Journal article
- DOI
-
10.1016/j.artint.2015.10.004
- Title of journal
- Artificial Intelligence
- Article number
- -
- First page
- 95
- Volume
- 235
- Issue
- -
- ISSN
- 0004-3702
- Open access status
- Out of scope for open access requirements
- Month of publication
- January
- Year of publication
- 2016
- 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)
-
-
- Citation count
- 13
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This is a conclusive study on syntax based faithful approximate ontology reasoning. It reports the key techniques behind the TrOWL approximate ontology reasoner, a top-3 reasoner for OWL2-DL realisation in the international sound-and-complete reasoner competition (ORE2014, http://ceur-ws.org/Vol-1207/competition.pdf), which accepts only 100% correct answers and is deemed to be almost impossible for approximate reasoners to perform well. The idea is to provide a sound and complete transformation a target OWL2-DL ontology into an EL++ ontology with a few semantic tables, and some TBox and ABox approximate deduction rules to cover interactions between axiom patterns that can be addressed in polynomial time.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
