| Publication | Date of Publication | Type |
|---|
On two-variable first-order logic with a partial order
Journal of Logic and Computation | 2026-03-05 | Paper |
| Adding transitivity and counting to the fluted fragment | 2024-09-25 | Paper |
The Fluted Fragment with Transitivity
(available as arXiv preprint) | 2022-07-21 | Paper |
The fluted fragment with transitive relations
Annals of Pure and Applied Logic | 2021-10-29 | Paper |
On the satisfiability problem for fragments of two-variable logic with one transitive relation
Journal Of Logic And Computation | 2020-01-29 | Paper |
The fluted fragment revisited
Journal of Symbolic Logic | 2019-09-17 | Paper |
The fluted fragment revisited
Journal of Symbolic Logic | 2019-09-17 | Paper |
Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants
ACM Transactions on Computational Logic | 2018-03-22 | Paper |
Equivalence closure in the two-variable guarded fragment
Journal Of Logic And Computation | 2018-02-13 | Paper |
| Quine's fluted fragment is non-elementary | 2017-07-19 | Paper |
Two-variable first-order logic with equivalence closure
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
| Means and limits of decision (invited talk) | 2017-02-02 | Paper |
| \(\mathrm{FO}^2\) with one transitive relation is decidable | 2017-01-30 | Paper |
Two-variable first-order logic with equivalence closure
SIAM Journal on Computing | 2014-09-18 | Paper |
Querying the guarded fragment with transitivity
Automata, Languages, and Programming | 2013-08-07 | Paper |
The complexity of finite model reasoning in description logics.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
The complexity of finite model reasoning in description logics
Information and Computation | 2005-08-05 | Paper |
The guarded fragment with transitive guards
Annals of Pure and Applied Logic | 2004-08-16 | Paper |
Complexity Results for First-Order Two-Variable Logic with Counting
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 627409 (Why is no real title available?) | 1994-08-31 | Paper |
