| Publication | Date of Publication | Type |
|---|
Completing the Picture: Complexity of Graded Modal Logics with Converse
Theory and Practice of Logic Programming | 2023-12-12 | Paper |
One-dimensional fragment over words and trees
Journal Of Logic And Computation | 2022-09-22 | Paper |
scientific article; zbMATH DE number 7561660 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561661 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Unary negation fragment with equivalence relations has the finite model property
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| Finite Model Theory of the Triguarded Fragment and Related Logics | 2021-01-20 | Paper |
| One-Dimensional Logic over Trees | 2020-05-26 | Paper |
Extending two-variable logic on trees
(available as arXiv preprint) | 2020-05-26 | Paper |
On the complexity of graded modal logics with converse
(available as arXiv preprint) | 2020-02-18 | Paper |
Decidability of weak logics with deterministic transitive closure
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | 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 |
| Uniform one-dimensional fragments with one equivalence relation | 2017-08-31 | Paper |
| One-dimensional logic over words | 2017-07-19 | Paper |
Complexity of two-variable logic on finite trees
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
On the decidability of elementary modal logics
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Two-variable first-order logic with equivalence closure
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Complexity and expressivity of uniform one-dimensional fragment with equality
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Two-variable first-order logic with equivalence closure
SIAM Journal on Computing | 2014-09-18 | Paper |
| scientific article; zbMATH DE number 6302919 (Why is no real title available?) | 2014-06-11 | Paper |
Complexity of two-variable logic on finite trees
Automata, Languages, and Programming | 2013-08-07 | Paper |
| Two-variable universal logic with transitive closure | 2012-11-22 | Paper |
Small substructures and decidability issues for first-order logic with two variables
The Journal of Symbolic Logic | 2012-09-19 | Paper |
| Decidability issues for two-variable logics with several linear orders | 2012-09-18 | Paper |
| Modal logics definable by universal three-variable formulas | 2012-08-31 | Paper |
B and D are enough to make the Halpern-Shoham logic undecidable
Automata, Languages and Programming | 2010-09-07 | Paper |
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
On the complexity of the two-variable guarded fragment with transitive guards
Information and Computation | 2007-01-22 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
| scientific article; zbMATH DE number 2086420 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1956520 (Why is no real title available?) | 2003-07-30 | Paper |
