Satisfiability for MTL and TPTL over Non-monotonic Data Words

Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas. Satisfiability for MTL and TPTL over Non-monotonic Data Words. In Adrian Horia Dediu, Carlos Martín-Vide, José Luis Sierra-Rodríguez, Bianca Truthe, editors, Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings. Volume 8370 of Lecture Notes in Computer Science, pages 248-259, Springer, 2014. [doi]

@inproceedings{CarapelleFGQ14,
  title = {Satisfiability for MTL and TPTL over Non-monotonic Data Words},
  author = {Claudia Carapelle and Shiguang Feng and Oliver Fernandez Gil and Karin Quaas},
  year = {2014},
  doi = {10.1007/978-3-319-04921-2_20},
  url = {http://dx.doi.org/10.1007/978-3-319-04921-2_20},
  researchr = {https://researchr.org/publication/CarapelleFGQ14},
  cites = {0},
  citedby = {0},
  pages = {248-259},
  booktitle = {Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings},
  editor = {Adrian Horia Dediu and Carlos Martín-Vide and José Luis Sierra-Rodríguez and Bianca Truthe},
  volume = {8370},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-04920-5},
}