Reasoning about Bounded Time Domain - An Alternative to NP-Complete Fragments of LTL

Norihiro Kamide. Reasoning about Bounded Time Domain - An Alternative to NP-Complete Fragments of LTL. In Joaquim Filipe, Ana L. N. Fred, Bernadette Sharp, editors, ICAART 2010 - Proceedings of the International Conference on Agents and Artificial Intelligence, Volume 1 - Artificial Intelligence, Valencia, Spain, January 22-24, 2010. pages 536-539, INSTICC Press, 2010.

@inproceedings{Kamide10a,
  title = {Reasoning about Bounded Time Domain - An Alternative to NP-Complete Fragments of LTL},
  author = {Norihiro Kamide},
  year = {2010},
  tags = {completeness},
  researchr = {https://researchr.org/publication/Kamide10a},
  cites = {0},
  citedby = {0},
  pages = {536-539},
  booktitle = {ICAART 2010 - Proceedings of the International Conference on Agents and Artificial Intelligence, Volume 1 - Artificial Intelligence, Valencia, Spain, January 22-24, 2010},
  editor = {Joaquim Filipe and Ana L. N. Fred and Bernadette Sharp},
  publisher = {INSTICC Press},
  isbn = {978-989-674-021-4},
}