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

3 kwietnia 2013 14:15
Andrea Calì (University of London, Birkbeck College & University of Oxford)
Decidable logics for the Semantic Web
The notion of Semantic Web involves the publication of data in machine-readable format. Such data are intended to be enriched with so-called ontologies, which express information about the domain of the data, in particular about …
27 marca 2013 14:15
Filip Mazowiecki (Uniwersytet Warszawski)
Complexity of two-variable logic over finite trees (joint work with Witold Charatonik and Emanuel Kieroński)
We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates child, right sibling, and their …
20 marca 2013 14:15
Nathanaël Fijalkow (Uniwersytet Warszawski)
Emptiness of alternating tree automata through games of imperfect information (joint work with Sophie Pinchinat and Olivier Serre)
In this talk, I will consider the emptiness problem for alternating tree automata with two different acceptance semantics: classical (all branches are accepted) and qualitative (almost all branches are accepted). I will show a new …
13 marca 2013 14:15
Petr Jančar (Technical University of Ostrava)
Equivalence of Deterministic One-Counter Automata is NL-complete (joint work with Stanislav Böhm and Stefan Göller)
We prove that language equivalence of deterministic one-counter automata is NL-complete. This improves the superpolynomial time complexity upper bound shown by Valiant and Paterson in 1975. Our main contribution is to prove that two deterministic …
6 marca 2013 14:15
Wojciech Czerwiński (University of Bayreuth)
Separability of Regular Languages by Piecewise Testable Languages (joint work with Wim Martens and Tomas Masopust)
The separation problem is formulated as follows: given two regular languages K and L, does there exists a "simple" regular language S separating them, i.e. including all words from K and no words from L? …
27 lutego 2013 14:15
Eryk Kopczyński (Uniwersytet Warszawski)
Trees in trees: is the incomplete information about a tree consistent?
We are interested in the following problem: given a tree automaton $\Aut$ and an incomplete tree description $P$, does a tree $T$ exist such that $T$ is accepted by $\Aut$ and consistent with $P$? A …
20 lutego 2013 14:15
Piotr Hofman and Filip Murlak (Uniwersytet Warszawski)
Synthesizing transformations from XML schema mappings (joint work with Claire David and Michał Pilipczuk)
XML schema mappings have been developed and studied in the context of XML data exchange, where a source document has to be restructured under the target schema according to certain rules. The rules are specified …
23 stycznia 2013 14:15
Leszek Kołodziejczyk (Uniwersytet Warszawski)
A collapse result for constant depth propositional proof systems with modular counting connectives - continuation
In the second part of my talk, I would like to discuss in more detail some issues that were mentioned only briefly in the first part. In particular, I would like to say some more …
16 stycznia 2013 14:15
Leszek Kołodziejczyk (Uniwersytet Warszawski)
A collapse result for constant depth propositional proof systems with modular counting connectives
A major open problem in propositional proof complexity is to obtain strong (ideally, exponential) lower bounds for the size of proofs of tautologies in constant depth proof systems with the usual boolean connectives and a …
9 stycznia 2013 14:15
Mikołaj Bojańczyk (Uniwersytet Warszawski)
Compactness in sets with atoms
This is another talk about sets with atoms (also known as Fraenkel-Mostowski sets, or nominal sets). Specifically, the topic is the notion of models for formulas of first-order logic. The problem is that a natural …
19 grudnia 2012 14:15
Michał Skrzypczak (Uniwersytet Warszawski)
Uniformization and selection for FO and MSO
Uniformization problem asks whether for a given formula phi(X,Y) there exists a formula psi(X,Y) that for every X selects exactly one Y satisfying phi(X,Y). Quite natural arguments show that MSO logic has uniformization property in …
5 grudnia 2012 14:15
Alessandro Facchini (Uniwersytet Warszawski)
Modal correspondence and fixpoints (joint work with Yde Venema and Fabio Zanasi)
Modal correspondence theory is the comparative study of expressiveness of modal languages and classical languages, like first order logic (FO) and monadic second order logic (MSO). The two main results in this context are van …
14 listopada 2012 14:15
Tomasz Gogacz (Uniwersytet Wrocławski)
On BDD/FC Conjecture (joint work with Jerzy Marcinkowski)
Bounded Derivation Depth property (BDD) and Finite Controllability (FC) are two properties of sets of tuple generating dependencies, which recently attracted some attention. We conjecture that the first of these properties implies the second, and …
7 listopada 2012 14:15
Charles Paperman (LIAFA, University Paris-Diderot)
Two-variable first order logic with modular predicates is decidable over words (joint work with Luc Dartois)
We consider first order formulae over the signature consisting of the symbols of the alphabet, the symbol $<$ (interpreted as a linear order) and the set $\MOD$ of modular numerical predicates. We study the expressive …
31 października 2012 14:15
Piotr Hofman (Uniwersytet Warszawski)
Weak simulation problem for one counter nets (joint work with Patrick Totzke and Richard Mayr)
One counter net is actually a one counter automaton without a possibility of testing the value 0. For example it can recognize a language a^n b^m for m less or equal n. Weak simulation is …