## Yves Moinard, Raymond Rolland

*Smallest Equivalent Sets for Finite Propositional Formula Circumscription*

ICLP, 2000.

@inproceedings{CL-2000-MoinardR, author = "Yves Moinard and Raymond Rolland", booktitle = "{Proceedings of the First International Conference on Computational Logic}", doi = "10.1007/3-540-44957-4_60", isbn = "3-540-67797-6", pages = "897--911", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Smallest Equivalent Sets for Finite Propositional Formula Circumscription}", volume = 1861, year = 2000, }