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

18 marca 2015 14:15
Amaldev Manuel (Uniwersytet Warszawski)
Mu-calculus on data words
I will describe Data automata, FO^2 and some natural fragments of Data automata defined by classes of Mu-calculus formulas and wrap it up by separating two classes using the circuits we discussed last time. If …
11 marca 2015 14:15
Charles Paperman (Uniwersytet Warszawski)
Circuits complexity and regular languages
I will talk about classical and recent developments on the subject: "Deciding the membership of regular languages in circuits complexity classes". This question is deeply interwoven with the algebraic characterization of classes of regular languages …
4 marca 2015 14:15
Henryk Michalewski (Uniwersytet Warszawski)
From parity games to linear optimization and back
Linear programs (LPs) can be solved efficiently, hence thedesire to reduce the parity games (PGs) to LPs. This seminar will bedevoted to a summary of attempted reductions published over the last 20 years.A polynomial solution …
25 lutego 2015 14:15
Wojciech Czerwiński (Uniwersytet Warszawski)
Tree Pattern Minimisation
I will consider the problem of minimising tree pattern queries. I will show you the example, which contradicted the long standing conjecture that minimality is the same as nonredundancy. Then I will present how this …
18 lutego 2015 14:15
Amaldev Manuel (Uniwersytet Warszawski)
Combinatorial expressions
Combinatorial expressions are expressions built using two kinds of functions --- those having bounded arity unbounded domain (e.g. addition of integers), and those having bounded domain and unrestricted arity (e.g. Boolean OR of k inputs, …
11 lutego 2015 14:15
Szymon Toruńczyk (Uniwersytet Warszawski)
Orbit-finite Constraint Satisfaction Problems
We study extensions of the classical Constraint Satisfaction Problem, to the orbit-finite setting. In one direction, we allow the instances to be orbit-finite, while preserving a finite template. We show that the problem remains decidable …
4 lutego 2015 14:15
Sławomir Lasota (Uniwersytet Warszawski)
First-order definable pushdown automata
We reinterpret the classical definition of pushdown automata in the setting of first-order definable sets (a subclass of sets with atoms). In view of potential applicability of this model in verification of recursive programs that …
28 stycznia 2015 14:15
Paweł Parys (Uniwersytet Warszawski)
892 Theorems about Tree Pattern Containment
We study the following problem of tree pattern containment: given two tree patterns, is it the case that the second pattern can be embedded into every tree into which the first pattern can be embedded. …
21 stycznia 2015 14:15
Wim Martens (Universität Bayreuth)
SCULPT: A Schema Language for Tabular Data on the Web
The World Wide Web Consortium has just started to think about a recommendation for tabular data and metadata on the Web. Inspired by these efforts, we develop a concept for a schema language for tabular …
14 stycznia 2015 14:15
Matthias Niewerth (Universität Bayreuth)
Reasoning about XML Constraints based on XML-to-relational mappings
I will introduce a framework for XML integrity constraints. AnXML-to-relational constraint consists of a mapping m, that maps trees to relations and a relational integrity constraint. We will have a look onthe complexity of the …
7 stycznia 2015 14:15
Igor Walukiewicz (CNRS and Bordeaux University)
A semantic model for verification of higher-order programs
We consider simply typed lambda-calculus with fixpoints as anon-interpreted functional programming language: the result of theexecution of a program is its normal form that can be seen as a,potentially infinite, tree of calls to built-in …
17 grudnia 2014 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Monads rulez
The algebraic approach to regular languages is to use monoids instead of automata. The algebraic approach has been extended to other settings, such as infinite words, countable total orders, and various kinds of trees. I …
10 grudnia 2014 14:15
Adam Witkowski (Uniwersytet Warszawski)
Datalog over trees strikes back
I will present the proof of decidability of containment of monadic, connected, linear Datalog programs over trees with infinite alphabet.
3 grudnia 2014 14:15
Marcin Przybyłko (Uniwersytet Warszawski)
Winning a Tree Game
Tree games extend standard turn based games by introducing so-called branching positions. When a player reaches such position, game automatically splits into several independent and concurrently executed sub-games. Unfortunately, this behavior may deprive players of …
26 listopada 2014 14:15
Nathanaël Fijalkow (Uniwersytet Warszawski)

Since I started my PhD, I already spoke twice at this seminar about the value 1 problem for probabilistic automata. This talk shall be the last on this topic, as it hopefully answers the initial …