×

Found 3 Documents (Results 1–3)

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field