Smallest Equivalent Sets for Finite Propositional Formula Circumscription

Yves Moinard, Raymond Rolland. Smallest Equivalent Sets for Finite Propositional Formula Circumscription. In John W. Lloyd, Verónica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, Peter J. Stuckey, editors, Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings. Volume 1861 of Lecture Notes in Computer Science, pages 897-911, Springer, 2000. [doi]

Abstract

Abstract is missing.