Modern database systems: the object model, interoperability, and beyond
Modern database systems: the object model, interoperability, and beyond
Minimization in cooperative response to failing database queries
Minimization in cooperative response to failing database queries
Understanding Natural Language
Understanding Natural Language
Using a Description Classifier to Enhance Knowledge Representation
IEEE Expert: Intelligent Systems and Their Applications
Explanations in Knowledge Systems: Design for Explainable Expert Systems
IEEE Expert: Intelligent Systems and Their Applications
Explaining reasoning in description logics
Explaining reasoning in description logics
| Hi-index | 0.00 |
This paper gives algorithms to compute the explanation of instance membership in classes over an Inference Hierarchy. iO(ic) time algorithms are given to compute the positive, negative, and conditional explanations over an Inference Hierarchy limited to conjunctive parents, where ic is the total number of conditions in the Inference Hierarchy.1 Algorithms requiring iO(ic2ik) time and space are given for computing the ik-minimal positive, negative and conditional explanations over disjunctive hierarchies with independent conditions. Worst-case exponential time is required for computing negative and negative conditional explanations over disjunctive hierarchies with dependent conditions. All types of explanation are worst-case exponential time for the ik-minimal explanations over hierarchies using negation in parent relationships. An application for these algorithms is provided. The application is motivated by the DARPA ALP storyboard and provides active mediation of airport facility status in a combat situation. These techniques may be transferred to financial, administrative, and environmental domains as well.