Babel Bohčme visit Babel Bohčme

Vince Bárány
  
 Contact

AG Logik, Fachbereich Mathematik
Technische Universität Darmstadt
Schloßgartenstraße 7
64289 Darmstadt
 Office: S2|15-204
 Phone: 06151 16-2215
 Email: barany<at>mathematik<dot>tu-darmstadt<dot>de

Research interests

  • Guarded logics
  • Finite and algorithmic model theory
  • Automata, rewriting, databases

  Activities

  AAAI 2012 | MFCS 2011

Teaching

SS 2012: Logik und Grundlagen
WS11/12: Mathe I für Bauingenieure, siehe TUCaN für mehr Information.

 At the University of Warsaw I tutored Complexity Theory in SS 2011
and lectured An introduction to temporal logics in WS 2010/2011.

From 2003 to 2007 I was teaching assitant of Prof. Erich Grädel, chair
of Mathematical Foundations of Computer Science at RWTH Aachen.

     Drafts

  1. Queries with Guarded Negation
    to appear in Proc. of VLDB 2012
    joint work with Balder ten Cate and Martin Otto
  2. Querying the guarded fragment, long version
    invited to the LMCS special issue on LICS'10
    joint work with Georg Gottlob and Martin Otto

Publications

  1. Finite satisfiability for Guarded Fixpoint Logic
    joint work with Mikołaj Bojańczyk
    Information Processing Letters, 112(10): 371-375, 2012.
  2. Guarded negation
    joint work with Balder ten Cate and Luc Segoufin
    in Proceedings of ICALP 2011.
  3. Automata-based presentations of infinite structures
    joint work with Erich Grädel and Sasha Rubin
    chapter 1 in Finite and Algorithmic Model Theory, volume 379 
    of London Mathematical Society Lecture Notes Series, Cambridge University Press, 2011.
  4. Expressing cardinality quantifiers in monadic second-order logic over chains
    joint work with Łukasz Kaiser and Alex Rabinovich
    Journal of Symbolic Logic 76(2):603-619, 2011.
  5. Querying the guarded fragment
    joint work with Georg Gottlob and Martin Otto
    in Proceedings of IEEE LICS'10.
  6. Expressing cardinality quantifiers in monadic second-order logic over trees
    joint work with Łukasz Kaiser and Alex Rabinovich
    Fundamenta Informaticae volume 100, pages 1-18, 2010.
  7. Cardinality quantifiers in MLO over trees
    joint work with Łukasz Kaiser and Alex Rabinovich,
    in Proc. 18th EACSL Annual Conference on Computer Science Logic, CSL'09.
  8. Semi-synchronous transductions
    Acta Informatica 46(1):29-42, 2009.
  9. Cardinality and counting quantifiers on omega-automatic structures
    joint work with Łukasz Kaiser and Sasha Rubin
    in Proc. 25th Annual Symp. on Theor. Aspects of Comp. Sci., STACS'08.
  10. A Hierarchy of Automatic omega-Words having a Decidable MSO Theory
    R.A.I.R.O Theoretical Informatics and Applications 42(3):417-450, 2008.
  11. A Hierarchy of Automatic omega-Words having a Decidable MSO Theory
    On-line proceedings of the 11th Journées Montoises, Rennes 2006.
  12. Invariants of automatic presentations and semi-synchronous transductions
    in Proc. 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006,
    B. Durand and W. Thomas (eds.), LNCS 3884, pp. 289-300.
  13. Regularity problems for visibly pushdown languages
    joint work with Christof Löding and Olivier Serre
    in Proc. 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006,
    B. Durand and W. Thomas (eds.), LNCS 3884, pp. 420-431.

Theses

  1. Automatic Presentations of Infinite Structures
    PhD. Thesis, RWTH Aachen Univeristy, 2007.
  2. A Story of Meaningless Terms, M.Sc. Thesis, Technical Report IR-502, Vrije Universiteit Amsterdam, 2002.

Slides of some talks

  1. Guarded Negation Queries, Oxford, June 2012.
  2. Guarded negation
    i. as presented at ICALP '11, Zürich, July 2011.
    ii. as presented at AlMoTh meeting, Leipzig, February 2011.
  3. Finite satisfiability for Guarded Fixpoint Logic is Decidable
    presented at GAMES 2010, Oxford, September 2010
  4. Querying the Guarded Fragment
    i. as presented at LICS 2010 , Edinburgh, July 2010
    ii. as presented at AlMoTh, Frankfurt, February 2010.
  5. Guarded logics: finite models with forbidden configurations
    invited talk at the Anglo-Belgian Workshop in Model Theory and Applications, Mons, 2009.
  6. Cardinality Quantifiers in Monadic Second-Order Logic
    Technical University of Darmstadt, February 2009.
  7. Cardinality and counting quantifiers on omega-automatic structures
    presented at STACS 2008, Bordeaux, February 2008.
  8. MSO + cardinality quantifiers on countable trees and linear orders
    presented at Dagstuhl Seminar 07441 "Algorithmic-Logical Theory of Infinite Structures", November 2007.
  9. Higher-order morphic words, presented at LaBRI, October 2007.
  10. A Hierarchy of Automatic omega-Words having a decidable MSO Theory
    presented at Journées Montoises, Rennes, 2006.
         

Updated July 2012