Details
Original language | English |
---|---|
Title of host publication | Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings |
Editors | Rastislav Královic, Damian Niwinski |
Pages | 587-599 |
Number of pages | 13 |
Volume | 5734 |
Publication status | Published - 2009 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. ed. / Rastislav Královic; Damian Niwinski. Vol. 5734 2009. p. 587-599 (Lecture Notes in Computer Science).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I
AU - Meier, Arne
AU - Mundhenk, Martin
AU - Schneider, Thomas
AU - Thomas, Michael
AU - Weber, Volker
AU - Weiss, Felix
N1 - Funding information: Supported in part by the grants DFG VO 630/6-1, DFG SCHW 678/4-1, BC-ARC 1323, DAAD-ARC D/08/08881.
PY - 2009
Y1 - 2009
U2 - 10.1007/978-3-642-03816-750
DO - 10.1007/978-3-642-03816-750
M3 - Conference contribution
VL - 5734
T3 - Lecture Notes in Computer Science
SP - 587
EP - 599
BT - Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings
A2 - Královic, Rastislav
A2 - Niwinski, Damian
ER -