Domain Abstraction and Limited Reasoning
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Reasoning. Pages 997-1002.
Abstract
We are investigating the possibility of constructing meaningful a.nd computationally efficient approximate reasoning methods for the first order logic . In particular, we study a situation when only certain aspects of the domain a.re of interest to the user. This is reflected by an equivalence relation defined on the domain of the knowledge base. The whole mechanism is called domain abstraction and is demonstrated to lead to significant computational advantages. The domain abstraction discussed in the paper is only a very special case of the more general notion of abstraction which is discussed shortly here and is a. subject of the currently ongoing research.
@inproceedings{ijcai1987p206,
title = {Domain Abstraction and Limited Reasoning},
author = {Imielinski, Tomasz},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {997--1002},
year = {1987},
note = {Reasoning},
url = {https://ijcai.org/proceedings/1987/206},
}
TY - CPAPER TI - Domain Abstraction and Limited Reasoning AU - Imielinski, Tomasz T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 997 EP - 1002 UR - https://ijcai.org/proceedings/1987/206 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: