Circumscription and Definability

Moinard, Yves; Rolland, Raymond

Circumscription and Definability

Download BibTeX Cite

Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Knowledge Representation. Pages 432-436.

Abstract

Thanks to two stronger versions of predicate circumscription (one of the best known non-monotonic reasoning methods), we give a definitive answer to two old open problems. The first one is the problem of expressing domain circumscription in terms of predicate circumscription. The second one is the problem of definability of the circumscribed predicates, asked by Doyle in 1985, and never answered since. These two results, and the way used to obtain them, could help an "automatic circumscriptor".

Yves Moinard, and Raymond Rolland. 1991. Circumscription and Definability. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91. IJCAI, 432–436. https://ijcai.org/proceedings/1991/65

@inproceedings{ijcai1991p65,
  title     = {Circumscription and Definability},
  author    = {Moinard, Yves and Rolland, Raymond},
  booktitle = {Proceedings of the Twelfth International Joint Conference on
               Artificial Intelligence, {IJCAI-91}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {John Mylopoulos and Ray Reiter},
  pages     = {432--436},
  year      = {1991},
  month     = {8},
  note      = {Knowledge Representation},
  url       = {https://ijcai.org/proceedings/1991/65},
}

TY  - CPAPER
TI  - Circumscription and Definability
AU  - Moinard, Yves
AU  - Rolland, Raymond
T2  - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1991
SP  - 432
EP  - 436
UR  - https://ijcai.org/proceedings/1991/65
ER  -