%0 Conference Paper %1 conf/cl/MoinardR00 %A Moinard, Yves %A Rolland, Raymond %B Computational Logic %D 2000 %E Lloyd, John W. %E Dahl, Verónica %E Furbach, Ulrich %E Kerber, Manfred %E Lau, Kung-Kiu %E Palamidessi, Catuscia %E Pereira, Luís Moniz %E Sagiv, Yehoshua %E Stuckey, Peter J. %I Springer %K dblp %P 897-911 %T Smallest Equivalent Sets for Finite Propositional Formula Circumscription. %U http://dblp.uni-trier.de/db/conf/cl/cl2000.html#MoinardR00 %V 1861 %@ 3-540-67797-6

@inproceedings{conf/cl/MoinardR00, added-at = {2017-05-19T00:00:00.000+0200}, author = {Moinard, Yves and Rolland, Raymond}, biburl = {https://www.bibsonomy.org/bibtex/22c111f64e90cd6c8a76b42726256b669/dblp}, booktitle = {Computational Logic}, crossref = {conf/cl/2000}, editor = {Lloyd, John W. and Dahl, Verónica and Furbach, Ulrich and Kerber, Manfred and Lau, Kung-Kiu and Palamidessi, Catuscia and Pereira, Luís Moniz and Sagiv, Yehoshua and Stuckey, Peter J.}, ee = {https://doi.org/10.1007/3-540-44957-4_60}, interhash = {dda1d759477380ebe821e82b625b01cd}, intrahash = {2c111f64e90cd6c8a76b42726256b669}, isbn = {3-540-67797-6}, keywords = {dblp}, pages = {897-911}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T14:07:50.000+0200}, title = {Smallest Equivalent Sets for Finite Propositional Formula Circumscription.}, url = {http://dblp.uni-trier.de/db/conf/cl/cl2000.html#MoinardR00}, volume = 1861, year = 2000 }