Olaf Beyersdorff, Leroy Chew. The Complexity of Theorem Proving in Circumscription and Minimal Entailment. In Stéphane Demri, Deepak Kapur, Christoph Weidenbach, editors, Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. Proceedings. Volume 8562 of Lecture Notes in Computer Science, pages 403-417, Springer, 2014. [doi]
Abstract is missing.