The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

  • Arne Meier
  • Martin Mundhenk
  • Thomas Schneider
  • Michael Thomas
  • Volker Weber
  • Felix Weiss
View graph of relations

Details

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings
EditorsRastislav Královic, Damian Niwinski
Pages587-599
Number of pages13
Volume5734
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Cite this

The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. / Meier, Arne; Mundhenk, Martin; Schneider, Thomas et al.
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 proceedingConference contributionResearchpeer review

Meier, A, Mundhenk, M, Schneider, T, Thomas, M, Weber, V & Weiss, F 2009, The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. in R Královic & D Niwinski (eds), Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. vol. 5734, Lecture Notes in Computer Science, pp. 587-599. https://doi.org/10.1007/978-3-642-03816-750
Meier, A., Mundhenk, M., Schneider, T., Thomas, M., Weber, V., & Weiss, F. (2009). The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. In R. Královic, & D. Niwinski (Eds.), Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings (Vol. 5734, pp. 587-599). (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-03816-750
Meier A, Mundhenk M, Schneider T, Thomas M, Weber V, Weiss F. The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. In Královic R, Niwinski D, editors, Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. Vol. 5734. 2009. p. 587-599. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-03816-750
Meier, Arne ; Mundhenk, Martin ; Schneider, Thomas et al. / The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. 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 ; Damian Niwinski. Vol. 5734 2009. pp. 587-599 (Lecture Notes in Computer Science).
Download
@inproceedings{abfc06f01ae04e319fb0c942123f70e1,
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",
note = "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.",
year = "2009",
doi = "10.1007/978-3-642-03816-750",
language = "English",
volume = "5734",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "587--599",
editor = "Rastislav Kr{\'a}lovic and Damian Niwinski",
booktitle = "Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings",

}

Download

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 -

By the same author(s)