On Proof Complexity of Circumscription

Uwe Egly, Hans Tompits. On Proof Complexity of Circumscription. In Harrie C. M. de Swart, editor, Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 98, Oisterwijk, The Netherlands, May 5-8, 1998, Proceedings. Volume 1397 of Lecture Notes in Computer Science, pages 141-155, Springer, 1998. [doi]

Abstract

Abstract is missing.