Moinard, Yves and Rolland, Raymond Circumscription and Definability , IJCAI'91 (Int. Joint Conf. on Artificial Intelligence) , Morgan Kaufmann , Sydney , 432--437 , aug , 1991 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". This web site is maintained by René Quiniou using the Weave system from the Caravel project: http://www-caravel.inria.fr. Last modification: 10-07-2011 09:54:25