Anuj Dawar

Bjarki Holm

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

The Ackermann Award 2013.

[BibT_eX]

[DOI]

Thomas A. Henzinger

Damian Niwinski

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

The dag-width of directed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

On Tractable Parameterizations of Graph Isomorphism.

[BibT_eX]

[DOI]

Adam Bouland

Eryk Kopczynski

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

The Ackermann Award 2012.

[BibT_eX]

[DOI]

Thierry Coquand

Damian Niwinski

Proceedings of the Computer Science Logic (CSL'12), 2012

2010

Homomorphism preservation on quasi-wide classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Properties of Almost All Graphs and Generalized Quantifiers.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

The Complexity of Satisfaction on Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

On Complete Problems, Relativizations and Logics for Complexity Classes.

[BibT_eX]

[DOI]

Proceedings of the Fields of Logic and Computation, 2010

2009

Affine systems of equations and counting infinitary logic.

[BibT_eX]

[DOI]

Andrei A. Bulatov

Theor. Comput. Sci., 2009

Parameterized Complexity of First-Order Logic.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2009

Domination Problems in Nowhere-Dense Classes of Graphs

[BibT_eX]

[DOI]

CoRR, 2009

Modal characterisation theorems over special classes of frames.

[BibT_eX]

[DOI]

Martin Otto

Ann. Pure Appl. Log., 2009

Parameterized Complexity Classes under Logical Reductions.

[BibT_eX]

[DOI]

Yuguo He

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Logics with Rank Operators.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Domination Problems in Nowhere-Dense Classes.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Structure and Specification as Sources of Complexity.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Separating Graph Logic from MSO.

[BibT_eX]

[DOI]

Timos Antonopoulos

Proceedings of the Foundations of Software Science and Computational Structures, 2009

2008

Preservation under Extensions on Well-Behaved Finite Structures.

[BibT_eX]

[DOI]

Martin Grohe

SIAM J. Comput., 2008

Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs.

[BibT_eX]

[DOI]

Benjamin Rossman

Ann. Pure Appl. Log., 2008

On the Descriptive Complexity of Linear Algebra.

[BibT_eX]

[DOI]

Proceedings of the Logic, 2008

On Datalog vs. LFP.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

The Descriptive Complexity of Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007

Generalising automaticity to modal properties of finite structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

The monadic theory of finite representations of infinite words.

[BibT_eX]

[DOI]

David Janin

Inf. Process. Lett., 2007

Expressiveness and complexity of graph logic.

[BibT_eX]

[DOI]

Philippa Gardner

Giorgio Ghelli

Inf. Comput., 2007

Finite Model Theory on Tame Classes of Structures.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Locally Excluding a Minor.

[BibT_eX]

[DOI]

Martin Grohe

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Model Theory Makes Formulas Large.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

The Power of Counting Logics on Restricted Classes of Finite Structures.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Model-Checking First-Order Logic: Automata and Locality.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

Backtracking games and inflationary fixed points.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

On preservation under homomorphisms and unions of conjunctive queries.

[BibT_eX]

[DOI]

Phokion G. Kolaitis

J. ACM, 2006

DAG-Width and Parity Games.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Approximation Schemes for First-Order Definable Optimisation Problems.

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005

Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract).

[BibT_eX]

[DOI]

Benjamin Rossman

Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

Complexity Bounds for Regular Games.

[BibT_eX]

[DOI]

Paul Hunter

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

How Many First-order Variables are Needed on Finite Ordered Structures?

[BibT_eX]

Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2004

Inflationary fixed points in modal logic.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2004

On the Bisimulation Invariant Fragment of Monadic S1 in the Finite.

[BibT_eX]

[DOI]

David Janin

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Adjunct Elimination Through Games in Static Ambient Logic.

[BibT_eX]

[DOI]

Philippa Gardner

Giorgio Ghelli

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

Fixed-point Logics with Nondeterministic Choice.

[BibT_eX]

[DOI]

J. Log. Comput., 2003

Guest editorial.

[BibT_eX]

[DOI]

Daniel Leivant

Inf. Comput., 2003

Foreword.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

A Fixed-Point Logic with Symmetric Choice.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

Fixed point logics.

[BibT_eX]

[DOI]

Yuri Gurevich

Bull. Symb. Log., 2002

1998

Capturing Relativized Complexity Classes without Order.

[BibT_eX]

[DOI]

Georg Gottlob

Math. Log. Q., 1998

Elementary Properties of the Finite Ranks.

[BibT_eX]

[DOI]

Math. Log. Q., 1998

A Restricted Second Order Logic for Finite Structures.

[BibT_eX]

[DOI]

Inf. Comput., 1998

Ordering Finite Variable Types with Generalized Quantifiers.

[BibT_eX]

[DOI]

Anil Seth

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1995

Infinitary Logic and Inductive Definability over Finite Structures

[BibT_eX]

[DOI]

Steven Lindell

Scott Weinstein

Inf. Comput., June, 1995

Generalized Quantifiers and Logical Reducibilities.

[BibT_eX]

[DOI]

J. Log. Comput., 1995

The expressive Power of Finitely Many Generalized Quantifiers.

[BibT_eX]

[DOI]

Inf. Comput., 1995

Types and Indiscernibles in Finite Models.

[BibT_eX]

[DOI]

Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

Generalized Quantifiers and 0-1 Laws

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1995

Implicit Definability and Infinitary Logic in Finite Model Theory.

[BibT_eX]

[DOI]

Phokion G. Kolaitis

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

First Order Logic, Fixed Point Logic and Linear Order.

[BibT_eX]

[DOI]

Steven Lindell

Scott Weinstein

Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1990

An Interpretation of Negation in Feature Structure Descriptions.

[BibT_eX]

K. Vijay-Shanker

Comput. Linguistics, 1990

1989

A Three-Valued Interpretation of Negation in Feature Structure Descriptions.

[BibT_eX]

[DOI]