Result 1 to 20 of 82 total
Intuitionistic implication makes model checking hard. (English)
Log. Methods Comput. Sci. 8, No. 2, Paper No. 3, 29 p., electronic only (2012).
1
The model checking problem for propositional intuitionistic logic with one variable is $\text{AC}^1$-complete. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 368-379, electronic only (2011).
2
Nonapproximability results for partially observable Markov decision processes. (English)
Comput. Res. Repos. 2011, Article No. 1106.0242 (2011).
3
How to apply SAT-solving for the equivalence test of monotone normal forms. (English)
Sakallah, Karem A. (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21580-3/pbk). Lecture Notes in Computer Science 6695, 105-119 (2011).
4
Model checking CTL is almost always inherently sequential. (English)
Log. Methods Comput. Sci. 7, No. 2, Paper No. 12, 21 p., electronic only (2011).
5
Model checking CTL is almost always inherently sequential. (English)
Comput. Res. Repos. 2011, Article No. 1103.4990 (2011).
6
Mathematical foundations of computer science. Mathematical thinking and proving. An introduction. (Mathematische Grundlagen der Informatik. Mathematisches Denken und Beweisen. Eine Einführung.) 5th revised ed. (German)
Leitfäden der Informatik. Studium. Wiesbaden: Vieweg+Teubner (ISBN 978-3-8348-1520-0/pbk). 335~p. EUR~29.95 (2011).
7
The tractability of model checking for LTL: the good, the bad, and the ugly fragments (English)
ACM Trans. Comput. Log. 12, No. 2, 13 (2011).
8
How to apply SAT-solving for the equivalence test of monotone normal forms (English)
SAT, 105-119 (2011).
9
The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete (English)
STACS, 368-379 (2011).
10
Complexity of hybrid logics over transitive frames. (English)
J. Appl. Log. 8, No. 4, 422-440 (2010).
11
The complexity of satisfiability for fragments of hybrid logic. I. (English)
J. Appl. Log. 8, No. 4, 409-421 (2010).
12
The complexity of model checking for intuitionistic logics and their modal companions. (English)
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).
13
The complexity of model checking for intuitionistic logics and their modal companions (English)
RP, 146-160 (2010).
14
The complexity of satisfiability for fragments of hybrid logic ‒ part I. (English)
Comput. Res. Repos. 2009, Article No. 0906.1489 (2009).
15
The tractability of model-checking for LTL: The good, the bad, and the ugly fragments. (English)
Electron. Notes Theor. Comput. Sci. 231, 277-292 (2009).
16
The complexity of hybrid logics over equivalence relations. (English)
J. Logic Lang. Inf. 18, No. 4, 493-514 (2009).
17
The complexity of satisfiability for fragments of CTL and CTL$^\bigstar $. (English)
Int. J. Found. Comput. Sci. 20, No. 5, 901-918 (2009).
18
The complexity of satisfiability for fragments of hybrid logic. I. (English)
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).
19
Model checking CTL is almost always inherently sequential (English)
TIME, 21-28 (2009).
20
Result 1 to 20 of 82 total
Start
Contact
Print
General Help
