NP-Completeness Results for Deductive Problems on Stratified Terms

Thierry Boy de la Tour, Mnacho Echenim. NP-Completeness Results for Deductive Problems on Stratified Terms. In Moshe Y. Vardi, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings. Volume 2850 of Lecture Notes in Computer Science, pages 317-331, Springer, 2003. [doi]

@inproceedings{TourE03:0,
  title = {NP-Completeness Results for Deductive Problems on Stratified Terms},
  author = {Thierry Boy de la Tour and Mnacho Echenim},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2850&spage=317},
  tags = {completeness},
  researchr = {https://researchr.org/publication/TourE03%3A0},
  cites = {0},
  citedby = {0},
  pages = {317-331},
  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings},
  editor = {Moshe Y. Vardi and Andrei Voronkov},
  volume = {2850},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-20101-7},
}