Circumscription and Definability
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.
Cite
Text
Moinard and Rolland. "Circumscription and Definability." International Joint Conference on Artificial Intelligence, 1991.Markdown
[Moinard and Rolland. "Circumscription and Definability." International Joint Conference on Artificial Intelligence, 1991.](https://mlanthology.org/ijcai/1991/moinard1991ijcai-circumscription/)BibTeX
@inproceedings{moinard1991ijcai-circumscription,
title = {{Circumscription and Definability}},
author = {Moinard, Yves and Rolland, Raymond},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1991},
pages = {432-437},
url = {https://mlanthology.org/ijcai/1991/moinard1991ijcai-circumscription/}
}