Hardness of Preorder Checking for Basic Formalisms

Laura Bozzelli, Axel Legay, Sophie Pinchinat. Hardness of Preorder Checking for Basic Formalisms. In Edmund M. Clarke, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010, Revised Selected Papers. Volume 6355 of Lecture Notes in Computer Science, pages 119-135, Springer, 2010. [doi]

@inproceedings{BozzelliLP10,
  title = {Hardness of Preorder Checking for Basic Formalisms},
  author = {Laura Bozzelli and Axel Legay and Sophie Pinchinat},
  year = {2010},
  doi = {10.1007/978-3-642-17511-4_8},
  url = {http://dx.doi.org/10.1007/978-3-642-17511-4_8},
  researchr = {https://researchr.org/publication/BozzelliLP10},
  cites = {0},
  citedby = {0},
  pages = {119-135},
  booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010, Revised Selected Papers},
  editor = {Edmund M. Clarke and Andrei Voronkov},
  volume = {6355},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-17510-7},
}