Olaf Beyersdorff, Leroy Chew. The Complexity of Theorem Proving in Circumscription and Minimal Entailment. In Stéphane Demri, Deepak Kapur, Christoph Weidenbach, editors, Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. Proceedings. Volume 8562 of Lecture Notes in Computer Science, pages 403-417, Springer, 2014. [doi]
@inproceedings{BeyersdorffC14-0,
title = {The Complexity of Theorem Proving in Circumscription and Minimal Entailment},
author = {Olaf Beyersdorff and Leroy Chew},
year = {2014},
doi = {10.1007/978-3-319-08587-6_32},
url = {http://dx.doi.org/10.1007/978-3-319-08587-6_32},
researchr = {https://researchr.org/publication/BeyersdorffC14-0},
cites = {0},
citedby = {0},
pages = {403-417},
booktitle = {Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. Proceedings},
editor = {Stéphane Demri and Deepak Kapur and Christoph Weidenbach},
volume = {8562},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-08586-9},
}