The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Arne Meier' in GoogleThis author has not been identified. Look up 'Martin Mundhenk' in GoogleThis author has not been identified. Look up 'Thomas Schneider' in GoogleThis author has not been identified. Look up 'Michael Thomas' in GoogleThis author has not been identified. Look up 'Volker Weber' in GoogleThis author has not been identified. Look up 'Felix Weiss' in Google

runs on WebDSL