Results on Translating Defaults to Circumscription
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 114-119.
Abstract
In this !Japer w•· define differ<·nt concept• of translating a set of defaults into circumscription. The most important of thesemodular translation requires that the additive changes of specific facts (not defaults) of default theory translate to the additive changes of the simple abnormality theory (corresponding to circumscription) . We show that , surprisingly enough, the important class of defaults, normal defaults with prerequisites , do not have such a. modular translation into circumscription (abnormality theory). We also establish the classes of defaults which are translatable into circumscription. For example we show that arbitrary combination (ordered combination) of seminormal defaults without prerequisites can be modularly translated into circumscription.
@inproceedings{ijcai1985p21,
title = {Results on Translating Defaults to Circumscription},
author = {Imielinski, Tomasz},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {114--119},
year = {1985},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1985/21},
}
TY - CPAPER TI - Results on Translating Defaults to Circumscription AU - Imielinski, Tomasz T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 114 EP - 119 UR - https://ijcai.org/proceedings/1985/21 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
