Journal
ARTIFICIAL INTELLIGENCE
Volume 250, Issue -, Pages 80-104Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.artint.2017.06.002
Keywords
Description logics; Axiom pinpointing; Computational complexity; Counting complexity; Enumeration complexity
Categories
Ask authors/readers for more resources
Lightweight description logics are knowledge representation formalisms characterised by the low complexity of their standard reasoning tasks. They have been successfully employed for constructing large ontologies that model domain knowledge in several different practical applications. In order to maintain these ontologies, it is often necessary to detect the axioms that cause a given consequence. This task is commonly known as axiom pinpointing. In this paper, we provide a thorough analysis of the complexity of several decision, counting, and enumeration problems associated to axiom pinpointing in lightweight description logics. (C) 2017 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available