Room S124, Floor 1, Malostranské náměstí 2/25, Praha 1
NTIN071 Automata and Grammars (Info in SIS)
NAIL062 Propositional and Predicate Logic (Info in SIS)
NOPT042 Constraint Programming (Info in SIS)
NTIN090 Intro to Complexity and Computability (Info in SIS)
Informal inquiries about thesis topics (as well as other topics) are most welcome.
My primary research interests lie in the intersection of theoretical computer science, computational logic, and universal algebra. A majority of my work is concerned with the complexity of the constraint satisfaction problem. I am also intersted in constraint modeling, automated theorem proving, and artificial intelligence.
J. Bulín, A. Krokhin, and J. Opršal. Algebraic approach to promise constraint satisfaction, Proceedings of the Annual ACM Symposium on Theory of Computing, 602–613 (2019)
J. Bulín. On the complexity of H-coloring for special oriented trees, European Journal of Combinatorics 69, 54–75 (2018)
L. Barto, J. Bulín. Deciding absorption in relational structures, Algebra Universalis 78(1), 3–18 (2017)
J. Bulín, D. Delić, M. Jackson, and T. Niven. A finer reduction of constraint problems to digraphs, Logical Methods in Computer Science 11(4:18), 1–33 (2015)