Meyer, TMoodley, KVarzinczak, I2010-10-122010-10-122010-08Meyer, T, Moodley, K and Varzinczak, I. 2010. First steps in the computation of root justifications. 2nd International Workshop on Automated Reasoning about Context and Ontology Evolution (ARCOE), Lisbon, Portugal, 16-17 August 2010, pp 2http://hdl.handle.net/10204/44802nd International Workshop on Automated Reasoning about Context and Ontology Evolution (ARCOE), Lisbon, Portugal, 16-17 August 2010Description Logics (DLs) are widely accepted as an appropriate class of knowledge representation languages to represent and reason about ontologies. Tools for performing standard reasoning tasks such as satisfiability and consequence checking have grown increasingly powerful and sophisticated in the last decade. In section 2 we review the standard approach for the resolution of modelling errors encountered in ontologies and propose the first steps in a new method for resolving such errors in section 3. The method is based on the notion of root justifications which we define and discuss. The approach we describe is applicable to a wide class of DLs. We don’t provide a comprehensive formal introduction to DLs, but rather point the reader to the book by Baader et al.enRoot justificationsOntologiesAutomated reasoningDescription logicsOntology evolutionConference PresentationMeyer, T., Moodley, K., & Varzinczak, I. (2010). First steps in the computation of root justifications. http://hdl.handle.net/10204/4480Meyer, T, K Moodley, and I Varzinczak. "First steps in the computation of root justifications." (2010): http://hdl.handle.net/10204/4480Meyer T, Moodley K, Varzinczak I, First steps in the computation of root justifications; 2010. http://hdl.handle.net/10204/4480 .TY - Conference Presentation AU - Meyer, T AU - Moodley, K AU - Varzinczak, I AB - Description Logics (DLs) are widely accepted as an appropriate class of knowledge representation languages to represent and reason about ontologies. Tools for performing standard reasoning tasks such as satisfiability and consequence checking have grown increasingly powerful and sophisticated in the last decade. In section 2 we review the standard approach for the resolution of modelling errors encountered in ontologies and propose the first steps in a new method for resolving such errors in section 3. The method is based on the notion of root justifications which we define and discuss. The approach we describe is applicable to a wide class of DLs. We don’t provide a comprehensive formal introduction to DLs, but rather point the reader to the book by Baader et al. DA - 2010-08 DB - ResearchSpace DP - CSIR KW - Root justifications KW - Ontologies KW - Automated reasoning KW - Description logics KW - Ontology evolution LK - https://researchspace.csir.co.za PY - 2010 T1 - First steps in the computation of root justifications TI - First steps in the computation of root justifications UR - http://hdl.handle.net/10204/4480 ER -