@inproceedings{DBLP:conf/cl/MoinardR00,
author = {Yves Moinard and
Raymond Rolland},
title = {Smallest Equivalent Sets for Finite Propositional Formula
Circumscription},
booktitle = {Computational Logic},
year = {2000},
pages = {897-911},
ee = {http://dx.doi.org/10.1007/3-540-44957-4_60},
crossref = {DBLP:conf/cl/2000},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/cl/2000,
editor = {John W. Lloyd and
Ver{\'o}nica Dahl and
Ulrich Furbach and
Manfred Kerber and
Kung-Kiu Lau and
Catuscia Palamidessi and
Lu\'{\i}s Moniz Pereira and
Yehoshua Sagiv and
Peter J. Stuckey},
title = {Computational Logic - CL 2000, First International Conference,
London, UK, 24-28 July, 2000, Proceedings},
booktitle = {CL},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1861},
year = {2000},
isbn = {3-540-67797-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2009-06-10 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
