Organizatorzy

prof. dr hab. Mikołaj Bojańczyk
prof. dr hab. Damian Niwiński

Informacje

środy, 14:15 , sala: 5050

Dziedziny badań

Lista referatów

17 października 2018 14:15
Bartosz Klin (Uniwersytet Warszawski)
PP is not a monad
Monads are mathematical objects that can be understood as "well-structured ways to collect things". Examples include the monad of finite words, the powerset monad P, the multiset monad, etc. In the talk I will explain …
17 października 2018 14:15
Jerome Leroux (University of Bordeaux)

We prove that the reachability relation of two-counter machines with one zero-test and one reset is Presburger-definable and effectively computable. Our proof is based on the introduction of two classes of Presburger-definable relations effectively stable …
10 października 2018 14:15
Lorenzo Clemente (Uniwersytet Warszawski)
Overview of classical and recent decidability and complexity results for networks of timed communicating automata
We present a journey into the study of timed communicating automata, a rich model of concurrency and communication incorporating timing features. We start from classic results for communicating automata (without time) giving intuitions on the …
3 października 2018 14:15
Edon Kelmendi (Uniwersytet Warszawski)
MSO+∇ is undecidable
We consider an extension of monadic second order logic on the infinite binary tree with a probabilistic path quantifier called ∇. Intuitively this quantifier means "the set of branches that satisfy a formula has probability 1". …
13 czerwca 2018 14:15
Szymon Toruńczyk (Uniwersytet Warszawski)
Dynamic Enumeration for First-Order Queries on Classes of Bounded Expansion
I will show the proof of the result announced in the previous talk. I will also discuss some theoretical applications of this result, in the context of machine learning.
6 czerwca 2018 14:15
Szymon Toruńczyk (Uniwersytet Warszawski)
Dynamic Enumeration for First-Order Queries on Classes of Bounded Expansion
Classes of bounded expansion, introduced by Nesetril and Ossona de Mendez, are sparse graph classes encompassing classes of planar graphs, classes with bounded maximal degree, classes of bounded treewidth, or more generally, any class of …
30 maja 2018 14:15
Paweł Parys (Uniwersytet Warszawski)
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
Several distinct techniques have been proposed to design quasi-polynomial algorithms for solving parity games since the breakthrough result of Calude, Jain, Khoussainov, Li, and Stephan (2017): play summaries, progress measures and universal trees, and register …
23 maja 2018 14:15
Vincent Michielini (Uniwersytet Warszawski)
Uniformization Problem for Variants of First Order Logic over Finite Words
We study the uniformization problem for natural variants of the first order logic over finite words. We show that none of them has the uniformization property, as witnessed by proposed counterexamples.
16 maja 2018 14:15
Samson Abramsky (University of Oxford)
Relating Structure and Power: Comonadic Semantics for Computational Resources
Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht-Fraisse games, pebble games, and bisimulation games play a central role. …
9 maja 2018 14:15
Bartosz Klin (Uniwersytet Warszawski)
Mu-calculi with atoms
I will show an extension of modal mu-calculus to sets with atoms, developed jointly with Mateusz Łełyk. Model checking is decidable there, and a correspondence to parity games holds. On the other hand, satisfiability becomes …
25 kwietnia 2018 14:15
Janusz Schmude (Uniwersytet Warszawski)
The “Hilbert Method” for Solving Transducer Equivalence Problems
The "Hilbert Method" applies classical results from algebraic geometry, e.g. Hilbert's Basis Theorem, to prove decidability of equivalence on certain classes of transducers. In the first part, following [1], we will describe the method and …
18 kwietnia 2018 14:15
Wojciech Czerwiński (Uniwersytet Warszawski)
Toolkit for VASSes
There are many natural problems for VASS systems, which are a bit similar in style to the reachability problem, but cannot be directly reduced to reachability. In order to solve them one needs to dig …
11 kwietnia 2018 14:15
Sławomir Lasota (University of Warsaw)
Regular Separability of Well-Structured Transition Systems
We investigate languages recognized by well-structured transition systems (WSTS), i.e., infinite systems with state space ordered by a well quasi-order (WQO). We show that, surprisingly, under very mild assumptions every two disjoint WSTS languages are regularly …
4 kwietnia 2018 14:15
Paweł Parys (Uniwersytet Warszawski)
Recursion Schemes and the WMSO+U Logic
We study the weak MSO logic extended by the unbounding quantifier (WMSO+U), expressing the fact that there exist arbitrarily large finite sets satisfying a given property. We prove that it is decidable whether the tree …
28 marca 2018 14:15
-
No seminar