Links' Seminars and Public Events | ![]() ![]() |
Wed, January 11, 2017 2:15 pm 3:25 pm | Michael vanden Boom, Oxford University : Decidable fixpoint logics Fixpoint logics can express dynamic, recursive properties, but often fail to have decidable satisfiability. A notable exception to this is the family of well-behaved "guarded" fixpoint logics, which subsume a variety of query languages and integrity constraints of interest in databases and knowledge representation. In this talk, I will survey some recent results about these logics. Lille B21 |
Mon, January 9, 2017 to Fri, January 13, 2017 all day | Visite Michael vanden Boom, Oxford University |
Fri, December 9, 2016 all day | Kickoff Headwork Paris MNHN |
Fri, November 18, 2016 10:30 am 12:00 pm | Florent Capelli Links Seminar "Lille-Salle B21" |
Fri, November 18, 2016 all day | Florent Capelli visit |
Tue, November 8, 2016 2:30 pm 4:30 pm | Seminar Link by Helmut Seidl: "Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable" Abstract: We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total transducers with unary output alphabet (over a given top-down regular domain language), and co-randomized polynomial time for linear transducers, these results are obtained using techniques from multi-linear algebra. For our main result, we prove that equivalence can be certified by means of inductive invariants using polynomial ideals. This allows us to construct two semi-algorithms, one searching for a proof of equivalence, one for a witness of non-equivalence. "Lille-Salle B31 " |
Mon, November 7, 2016 2:00 pm 4:00 pm | PhD defense Adrien Boiret |
Fri, November 4, 2016 all day | colis general meeting Paris |
Thu, October 27, 2016 10:00 am 6:00 pm | Links day |
Thu, October 27, 2016 all day | links day |