The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete.

Arnaud Durand, Miki Hermann

Browse the full STACS paper archive.