Olaf Beyersdorff, Leroy Chew
The Complexity of Theorem Proving in Circumscription and Minimal Entailment
IJCAR, 2014.
@inproceedings{IJCAR-2014-BeyersdorffC, author = "Olaf Beyersdorff and Leroy Chew", booktitle = "{Proceedings of the Seventh International Joint Conference on Automated Reasoning}", doi = "10.1007/978-3-319-08587-6_32", isbn = "978-3-319-08586-9", pages = "403--417", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{The Complexity of Theorem Proving in Circumscription and Minimal Entailment}", volume = 8562, year = 2014, }