| Publication | Date of Publication | Type |
|---|
| The complexity of Presburger arithmetic with power or powers | 2024-11-14 | Paper |
| Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory | 2024-09-04 | Paper |
| Two variable logic with ultimately periodic counting | 2024-07-17 | Paper |
| The past and future of embedded finite model theory | 2023-07-21 | Paper |
| Embedded Finite Models beyond Restricted Quantifier Collapse | 2023-04-18 | Paper |
| On Monotonic Determinacy and Rewritability for Recursive Queries and Views | 2023-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5094143 | 2022-08-02 | Paper |
| Generating Plans from Proofs | 2021-11-25 | Paper |
| Analysis of Schemas with Access Restrictions | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144648 | 2021-01-19 | Paper |
| Datasets for Guarded Saturation | 2020-12-17 | Dataset |
| Finite Open-world Query Answering with Number Restrictions | 2020-09-11 | Paper |
| Characterizing Definability in Decidable Fixpoint Logics | 2020-05-27 | Paper |
| Monadic Datalog, Tree Validity, and Limited Access Containment | 2019-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5232911 | 2019-09-13 | Paper |
| Logical foundations of information disclosure in ontology-based data integration | 2019-01-18 | Paper |
| SOME MODEL THEORY OF GUARDED NEGATION | 2019-01-04 | Paper |
| Query Answering with Transitive and Linear-Ordered Data | 2018-11-01 | Paper |
| Interpolation with Decidable Fixpoint Logics | 2018-04-23 | Paper |
| A Step Up in Expressiveness of Decidable Fixpoint Logics | 2018-04-23 | Paper |
| The Complexity of Boundedness for Guarded Logics | 2018-04-23 | Paper |
| Querying Visible and Invisible Information | 2018-04-23 | Paper |
| Effective interpolation and preservation in guarded logics | 2018-04-23 | Paper |
| Finite Open-World Query Answering with Number Restrictions | 2018-04-23 | Paper |
| Complexity of Two-Variable Logic on Finite Trees | 2017-07-13 | Paper |
| Logical definability and query languages over ranked and unranked trees | 2017-07-12 | Paper |
| Limiting Until in Ordered Tree Query Languages | 2017-07-12 | Paper |
| Effective Interpolation and Preservation in Guarded Logics | 2017-07-12 | Paper |
| Bisimilarity of Pushdown Automata is Nonelementary | 2017-07-03 | Paper |
| Determinacy and rewriting of functional top-down and MSO tree transformations | 2016-12-28 | Paper |
| Generating plans from proofs. The interpolation-based approach to query reformulation | 2016-04-08 | Paper |
| Relational queries over interpreted structures | 2015-12-17 | Paper |
| Definable relations and first-order query languages over strings | 2015-11-12 | Paper |
| The complexity of higher-order queries | 2015-09-28 | Paper |
| Regular tree languages definable in FO and in FO mod | 2015-09-17 | Paper |
| The per-character cost of repairing word languages | 2014-06-06 | Paper |
| Databases | 2014-02-21 | Paper |
| Bounded repairability of word languages | 2014-01-27 | Paper |
| Rewriting Guarded Negation Queries | 2013-09-20 | Paper |
| Determinacy and Rewriting of Top-Down and MSO Tree Transformations | 2013-09-20 | Paper |
| Complexity of Two-Variable Logic on Finite Trees | 2013-08-07 | Paper |
| LTL Model Checking of Interval Markov Chains | 2013-08-05 | Paper |
| Two Variable vs. Linear Temporal Logic in Model Checking and Games | 2013-06-20 | Paper |
| Monadic Datalog Containment | 2012-11-01 | Paper |
| Two Variable vs. Linear Temporal Logic in Model Checking and Games | 2011-09-02 | Paper |
| The Cost of Traveling between Languages | 2011-07-07 | Paper |
| Automata vs. Logics on Data Words | 2010-09-03 | Paper |
| Towards a characterization of order-invariant queries over tame graphs | 2009-03-25 | Paper |
| XPath satisfiability in the presence of DTDs | 2008-12-21 | Paper |
| A characterization of first-order topological properties of planar spatial data | 2008-12-21 | Paper |
| Efficient and Expressive Tree Filters | 2008-04-24 | Paper |
| Interpreting Tree-to-Tree Queries | 2007-09-11 | Paper |
| Computer Science Logic | 2006-11-01 | Paper |
| Database Programming Languages | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477350 | 2006-07-03 | Paper |
| Computer Aided Verification | 2006-01-10 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Algebraic Methodology and Software Technology | 2005-08-25 | Paper |
| Structural properties of XPath fragments | 2005-06-10 | Paper |
| Definability with a predicate for a semi-linear set | 2004-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414527 | 2003-07-25 | Paper |
| Reachability and connectivity queries in constraint databases | 2003-06-25 | Paper |
| Aggregate operators in constraint query languages | 2002-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535054 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753675 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508939 | 2000-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508937 | 2000-10-10 | Paper |
| Stability theory, permutations of indiscernibles, and embedded finite models | 2000-10-03 | Paper |
| Safe Constraint Queries | 2000-03-19 | Paper |
| Hierarchies of measure-theoretic ultrafilters | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936135 | 2000-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863304 | 1999-10-28 | Paper |
| Ultrafilters which extend measures | 1999-04-27 | Paper |
| Verifiable properties of database transactions | 1999-03-22 | Paper |
| Relational expressive power of constraint query languages | 1998-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362726 | 1997-11-13 | Paper |
| Two variable logic with ultimately periodic counting | N/A | Paper |
