Meier, Arne; Mundhenk, Martin; Schneider, Thomas; Thomas, Michael; Weber, Volker; Weiss, Felix The complexity of satisfiability for fragments of hybrid logic. I. (English) Zbl 1215.03034 J. Appl. Log. 8, No. 4, 409-421 (2010). MSC: 03B45 03B25 PDFBibTeX XMLCite \textit{A. Meier} et al., J. Appl. Log. 8, No. 4, 409--421 (2010; Zbl 1215.03034) Full Text: DOI
Mundhenk, Martin; Weiß, Felix The complexity of model checking for intuitionistic logics and their modal companions. (English) Zbl 1287.68110 Kučera, Antonín (ed.) et al., Reachability problems. 4th international workshop, RP 2010, Brno, Czech Republic, August 28–29, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15348-8/pbk). Lecture Notes in Computer Science 6227, 146-160 (2010). MSC: 68Q60 03B20 03B45 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Mundhenk} and \textit{F. Weiß}, Lect. Notes Comput. Sci. 6227, 146--160 (2010; Zbl 1287.68110) Full Text: DOI
Meier, Arne; Mundhenk, Martin; Schneider, Thomas; Thomas, Michael; Weber, Volker; Weiss, Felix The complexity of satisfiability for fragments of hybrid logic. I. (English) Zbl 1250.03036 Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 587-599 (2009). MSC: 03B45 03B25 68Q25 PDFBibTeX XMLCite \textit{A. Meier} et al., Lect. Notes Comput. Sci. 5734, 587--599 (2009; Zbl 1250.03036) Full Text: DOI