Neat Explanation of Proof Trees
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Expert Systems. Pages 379-380.
Abstract
It is essential that the reasoning of an expert system can be explained and justified. In the paper simple ideas for providing comprehensive explanations of deductions are presented. The method is to transform the proof tree to a more comprehensive proof tree from which a neat explanation directly can be extracted. The tran sformation of proof trees is a way to view the problem of explaining the reasoning of an expert system. The ideas presented in this paper are easy to implement. Furthermore , the transformation for reducing chains of specifications of a concept seems to be applicable in general. The transformation for introducing a new name for a compilation of concepts depends on the problem domain.
@inproceedings{ijcai1985p71,
title = {Neat Explanation of Proof Trees},
author = {Eriksson, Agneta and Johansson, Anna-Lena},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {379--380},
year = {1985},
note = {Expert Systems},
url = {https://ijcai.org/proceedings/1985/71},
}
TY - CPAPER TI - Neat Explanation of Proof Trees AU - Eriksson, Agneta AU - Johansson, Anna-Lena T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 379 EP - 380 UR - https://ijcai.org/proceedings/1985/71 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
