Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss. The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. In Rastislav Královic, Damian Niwinski, editors, Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. Volume 5734 of Lecture Notes in Computer Science, pages 587-599, Springer, 2009. [doi]
@inproceedings{MeierMSTWW09,
title = {The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I},
author = {Arne Meier and Martin Mundhenk and Thomas Schneider and Michael Thomas and Volker Weber and Felix Weiss},
year = {2009},
doi = {10.1007/978-3-642-03816-7_50},
url = {http://dx.doi.org/10.1007/978-3-642-03816-7_50},
tags = {logic},
researchr = {https://researchr.org/publication/MeierMSTWW09},
cites = {0},
citedby = {0},
pages = {587-599},
booktitle = {Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings},
editor = {Rastislav Královic and Damian Niwinski},
volume = {5734},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-03815-0},
}