Inverse Circumscription
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 449-453.
Abstract
Inverse (or identification) problems involve deciding whether or not an explicitly given set of data points have an implicit description, for instance, in the form of a constraint network. Such problems provide insight into the relationships among various representations of knowledge, which may have differing computational properties. This paper formalizes and studies the inverse circumscription problem, which (roughly speaking) is to decide, given a set of models, if there exists a formula whose circumscription describes the input set.
@inproceedings{ijcai2003p67,
title = {Inverse Circumscription},
author = {Chen, Hubie},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {449--453},
year = {2003},
url = {https://ijcai.org/proceedings/2003/67},
}
TY - CPAPER TI - Inverse Circumscription AU - Chen, Hubie T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 449 EP - 453 UR - https://ijcai.org/proceedings/2003/67 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: