The Complexity of Theorem Proving in Circumscription and Minimal Entailment.

Olaf Beyersdorff, Leroy Chew

Browse the full CADE paper archive.