

Contact
AG
Logik, Fachbereich Mathematik
Technische Universität Darmstadt
Schloßgartenstraße 7
64289 Darmstadt
Office:
S215204
Phone: 06151 162215
Email:
barany<at>mathematik<dot>tudarmstadt<dot>de

Research
interests

Guarded logics

Finite and algorithmic model theory

Automata, rewriting, databases
Activities
Teaching
Drafts

Queries with Guarded Negation
to appear in Proc. of VLDB 2012
joint work with Balder ten Cate and Martin Otto

Querying the guarded fragment, long version
invited to the LMCS special issue on LICS'10
joint work with Georg Gottlob and Martin Otto
Publications

Finite satisfiability for Guarded Fixpoint Logic
joint work with Mikołaj Bojańczyk
Information Processing Letters, 112(10): 371375, 2012.

Guarded negation
joint work with Balder ten Cate and Luc Segoufin
in Proceedings of ICALP 2011.

Automatabased 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.

Expressing cardinality quantifiers in monadic secondorder logic
over chains
joint work with Łukasz Kaiser and Alex Rabinovich
Journal of Symbolic Logic 76(2):603619, 2011.

Querying the guarded fragment
joint work with Georg Gottlob and Martin Otto
in Proceedings of IEEE LICS'10.
 Expressing
cardinality quantifiers in monadic secondorder logic over
trees
joint work with Łukasz Kaiser and Alex Rabinovich
Fundamenta Informaticae volume 100, pages
118, 2010.
 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.
 Semisynchronous
transductions
Acta Informatica 46(1):2942, 2009.
 Cardinality
and counting quantifiers on omegaautomatic structures
joint work with Łukasz Kaiser and Sasha Rubin
in Proc. 25th Annual Symp. on Theor. Aspects of Comp. Sci., STACS'08.
 A
Hierarchy of Automatic omegaWords having a Decidable MSO Theory
R.A.I.R.O Theoretical Informatics and Applications 42(3):417450,
2008.
 A
Hierarchy of Automatic omegaWords having a Decidable MSO Theory
Online proceedings of the 11th Journées Montoises, Rennes 2006.
 Invariants
of automatic presentations and semisynchronous transductions
in Proc. 23rd Annual Symposium on Theoretical Aspects of Computer
Science, STACS 2006,
B. Durand and W. Thomas (eds.), LNCS 3884, pp. 289300.
 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. 420431.
Theses
 Automatic
Presentations of Infinite Structures
PhD. Thesis, RWTH Aachen Univeristy, 2007.
 A Story of
Meaningless Terms, M.Sc. Thesis, Technical Report IR502, Vrije
Universiteit Amsterdam, 2002.
Slides
of some talks

Guarded Negation Queries, Oxford, June 2012.
 Guarded negation
i. as presented at ICALP '11,
Zürich, July 2011.
ii. as presented at AlMoTh meeting,
Leipzig, February 2011.
 Finite
satisfiability for Guarded Fixpoint Logic is Decidable
presented at GAMES 2010, Oxford, September 2010
 Querying the Guarded Fragment
i. as
presented at LICS 2010 , Edinburgh, July 2010
ii. as
presented at AlMoTh, Frankfurt, February 2010.
 Guarded logics: finite models with
forbidden
configurations
invited talk at the AngloBelgian Workshop in Model Theory and
Applications, Mons, 2009.
 Cardinality Quantifiers in Monadic
SecondOrder Logic
Technical University of Darmstadt, February 2009.

Cardinality and counting quantifiers on omegaautomatic structures
presented at STACS 2008, Bordeaux, February 2008.

MSO + cardinality quantifiers on countable trees and linear orders
presented at Dagstuhl Seminar 07441 "AlgorithmicLogical Theory of Infinite Structures", November 2007.

Higherorder morphic words, presented at LaBRI, October 2007.

A Hierarchy of Automatic omegaWords having a decidable MSO Theory
presented at Journées Montoises, Rennes, 2006.

