Martin Otto

Affiliations:
  • TU Darmstadt, Germany


According to our database1, Martin Otto authored at least 55 papers between 1992 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A First-order Framework for Inquisitive Modal Logic.
Rev. Symb. Log., 2022

2021
Inquisitive Bisimulation.
J. Symb. Log., 2021

2020
Guarded Teams: The Horizontally Guarded Case.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
Graded modal logic and counting bisimulation.
CoRR, 2019

Cayley structures and common knowledge.
CoRR, 2019

Additive First-Order Queries.
Proceedings of the 22nd International Conference on Database Theory, 2019

2017
Bisimulation in Inquisitive Modal Logic.
Proceedings of the Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2017

Common knowledge and multi-scale locality analysis in Cayley structures.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Bounded Variable Logics and Counting: A Study in Finite Models
Lecture Notes in Logic 9, Cambridge University Press, ISBN: 9781316716878, 2017

2015
Pebble Games and linear equations.
J. Symb. Log., 2015

2014
Decidability Results for the Boundedness Problem.
Log. Methods Comput. Sci., 2014

Querying the Guarded Fragment.
Log. Methods Comput. Sci., 2014

The Freedoms of (Guarded) Bisimulation.
Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

2013
Expressive completeness through logically tractable models.
Ann. Pure Appl. Log., 2013

Groupoids, Hypergraphs, and Symmetries in Finite Models.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Bisimulation and Coverings for Graphs and Hypergraphs.
Proceedings of the Logic and Its Applications, 5th Indian Conference, 2013

2012
Queries with Guarded Negation.
Proc. VLDB Endow., 2012

Small substructures and decidability issues for first-order logic with two variables.
J. Symb. Log., 2012

Highly acyclic groups, hypergraph covers, and the guarded fragment.
J. ACM, 2012

Queries with Guarded Negation (full version)
CoRR, 2012

2011
The Freedoms of Guarded Bisimulation.
Proceedings of the Computer Science Logic, 2011

Model theoretic methods for fragments of FO and special classes of (finite) structures.
Proceedings of the Finite and Algorithmic Model Theory., 2011

2009
Modal characterisation theorems over special classes of frames.
Ann. Pure Appl. Log., 2009

Boundedness of Monadic Second-Order Formulae over Finite Words.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
A Lindström characterisation of the guarded fragment and of modal logic with a global modality.
Proceedings of the Advances in Modal Logic 7, 2008

2007
Boundedness of Monadic FO over Acyclic Structures.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Model theory of modal logic.
Proceedings of the Handbook of Modal Logic., 2007

2006
The Boundedness Problem for Monadic Universal First-Order Logic.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2004
Modal and guarded characterisation theorems over finite transition systems.
Ann. Pure Appl. Log., 2004

2003
Finite conformal hypergraph covers and Gaifman cliques in finite structures.
Bull. Symb. Log., 2003

2002
Back and forth between guarded and modal logics.
ACM Trans. Comput. Log., 2002

2001
Two Variable First-Order Logic over Ordered Domains.
J. Symb. Log., 2001

Adding For-Loops to First-Order Logic.
Inf. Comput., 2001

2000
Epsilon-Logic Is More Expressive Than First-Order Logic Over Finite Structures.
J. Symb. Log., 2000

An interpolation theorem.
Bull. Symb. Log., 2000

1999
Bisimulation-invariant PTIME and higher-dimensional µ-calculus.
Theor. Comput. Sci., 1999

On Logics with Two Variables.
Theor. Comput. Sci., 1999

Bounded variable logics: two, three, and more.
Arch. Math. Log., 1999

Undecidability results on two-variable logics.
Arch. Math. Log., 1999

Eliminating Recursion in the µ-Calculus.
Proceedings of the STACS 99, 1999

Beth Definability for the Guarded Fragment.
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

1998
On the Boundedness Problem for Two-Variable First-Order Logic.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Canonization for Two Variables and Puzzles on the Square.
Ann. Pure Appl. Log., 1997

Two-Variable Logic with Counting is Decidable.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

Capturing Bisimulation-Invariant Ptime.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Bounded variable logics and counting - a study in finite models.
Lecture Notes in Logic 9, Springer, ISBN: 978-3-540-62037-2, 1997

1996
The Expressive Power of Fixed-Point Logic with Counting.
J. Symb. Log., 1996

First-Order Queries on Databases Embedded in an Infinite Structure.
Inf. Process. Lett., 1996

The Logic of Explicitly Presentation-Invariant Circuits.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995
An Note on the Number of Monadic Quantifiers in Monadic Sigma^1_1.
Inf. Process. Lett., 1995

Ptime Canonization for Two Variables with Counting
Proceedings of the Proceedings, 1995

1994
Generalized Quantifiers for Simple Properties
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1992
Automorphism Properties of Stationary Logic.
J. Symb. Log., 1992

EM constructions for a class of generalized quantifiers.
Arch. Math. Log., 1992

Inductive Definability with Counting on Finite Structures.
Proceedings of the Computer Science Logic, 6th Workshop, 1992


  Loading...