Michael Thomas. The Complexity of Circumscriptive Inference in Post s Lattice. In Esra Erdem, Fangzhen Lin, Torsten Schaub, editors, Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings. Volume 5753 of Lecture Notes in Computer Science, pages 290-302, Springer, 2009. [doi]
@inproceedings{Thomas09-10,
title = {The Complexity of Circumscriptive Inference in Post s Lattice},
author = {Michael Thomas},
year = {2009},
doi = {10.1007/978-3-642-04238-6_25},
url = {http://dx.doi.org/10.1007/978-3-642-04238-6_25},
researchr = {https://researchr.org/publication/Thomas09-10},
cites = {0},
citedby = {0},
pages = {290-302},
booktitle = {Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings},
editor = {Esra Erdem and Fangzhen Lin and Torsten Schaub},
volume = {5753},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-04237-9},
}