Inverse Circumscription

Abstract

Inverse (or identification) problems involve deciding whether or not an explicitly given set of data
\npoints have an implicit description, for instance,
\nin the form of a constraint network. Such problems provide insight into the relationships among
\nvarious representations of knowledge, which may
\nhave 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
\nwhose circumscription describes the input set.

Cite

Text

Chen. "Inverse Circumscription." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[Chen. "Inverse Circumscription." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/chen2003ijcai-inverse/)

BibTeX

@inproceedings{chen2003ijcai-inverse,
  title     = {{Inverse Circumscription}},
  author    = {Chen, Hubie},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {449-454},
  url       = {https://mlanthology.org/ijcai/2003/chen2003ijcai-inverse/}
}