Organizatorzy

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

Informacje

środy, 14:15 , sala: 5440

Dziedziny badań

Lista referatów

5 grudnia 2018 14:15
Alexandre Vigny (Uniwersytet Warszawski)
Query enumeration and nowhere dense classes of graphs
Given a query q and a relational structure D the enumeration of q over D consists in computing, one element at a time, the set q(D) of all solutions to q on D. The delay …
28 listopada 2018 14:15
Ian Pratt-Hartmann (University of Manchester)
The Return of the Syllogism
The Aristotelian syllogistic is known to do a good job of accounting for the validity of inferences couched in a certain common fragment of many natural languages. To take an example from English: Every man …
14 listopada 2018 14:15
Laurent Doyen (CNRS & LSV, ENS Paris-Saclay)
Graph Planning with Expected Finite Horizon
A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon …
7 listopada 2018 14:15
Bartosz Klin (Uniwersytet Warszawski)
PP is not a monad (joint work with Julian Salamanca)
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 …
31 października 2018 14:15
Wojciech Czerwiński (Uniwersytet Warszawski)
The Reachability Problem for Vector Addition Systems is Not Elementary
I will present a recent result about tower lower bound for reachability problem in VASes. I plan to first illustrate a few phenomena occuring in VASes by examples. Then I will show a full proof …
24 października 2018 14:15
Nathan Lhote (Uniwersytet Warszawski)
Logics for Transductions
Logics over words such as Monadic Second-Order Logic, or Linear Temporal Logic provide a way to specify properties of systems in a high-level formalism, close to natural language. From such formulas one would like to …
17 października 2018 14:15
Jerome Leroux (University of Bordeaux)
(CHANGE!) Reachability for Two-Counter Machines with One Test and One Rese)
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 …
17 października 2018 14:15
Bartosz Klin (Uniwersytet Warszawski)
PP is not a monad (joint work with Julian Salamanca)
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 …
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 (joint work with Mikołaj Bojańczyk and Michał Skrzypczak)
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 (Joint work with Michał Pilipczuk)
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 (Joint work with Michał Pilipczuk)
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 (joint work with Wojciech Czerwiński, Laure Daviaud, Nathanael Fijalkow, Marcin Jurdziński, Ranko Lazić)
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. …