The Complexity of Circumscriptive Inference in Post s Lattice

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]

Abstract

Abstract is missing.