Is Non-Monotonic Reasoning Always Harder?

Uwe Egly, Hans Tompits. Is Non-Monotonic Reasoning Always Harder?. In Jürgen Dix, Ulrich Furbach, Anil Nerode, editors, Logic Programming and Nonmonotonic Reasoning, 4th International Conference, LPNMR 97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings. Volume 1265 of Lecture Notes in Computer Science, pages 60-75, Springer, 1997.

@inproceedings{EglyT97:0,
  title = {Is Non-Monotonic Reasoning Always Harder?},
  author = {Uwe Egly and Hans Tompits},
  year = {1997},
  researchr = {https://researchr.org/publication/EglyT97%3A0},
  cites = {0},
  citedby = {0},
  pages = {60-75},
  booktitle = {Logic Programming and Nonmonotonic Reasoning, 4th International Conference, LPNMR 97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings},
  editor = {Jürgen Dix and Ulrich Furbach and Anil Nerode},
  volume = {1265},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-63255-7},
}