| Publication | Date of Publication | Type |
|---|
Two variable logic with ultimately periodic counting
(available as arXiv preprint) | N/A | Paper |
Tighter bounds for query answering with guarded TGDs
Logical Methods in Computer Science | 2026-05-29 | Paper |
| Two variable logic with ultimately periodic counting | 2026-03-18 | Paper |
| Embedded finite models beyond restricted quantifier collapse | 2026-02-27 | Paper |
| Decidability of graph neural networks via logical characterizations | 2026-01-14 | Paper |
Towards unbiased exploration in partial label learning
Journal of Machine Learning Research (JMLR) | 2025-05-12 | Paper |
| 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
Logical Methods in Computer Science | 2024-09-04 | Paper |
Two variable logic with ultimately periodic counting
SIAM Journal on Computing | 2024-07-17 | Paper |
The past and future of embedded finite model theory
Lecture Notes in Computer Science | 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
ACM Transactions on Computational Logic | 2023-04-05 | Paper |
When can we answer queries using result-bounded data interfaces?
(available as arXiv preprint) | 2022-08-02 | Paper |
| When can we answer queries using result-bounded data interfaces? | 2022-08-02 | Paper |
Analysis of schemas with access restrictions
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Analysis of schemas with access restrictions
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Generating plans from proofs
ACM Transactions on Database Systems | 2021-11-25 | Paper |
| Polynomial automata: zeroness and applications | 2021-01-19 | Paper |
| Datasets for Guarded Saturation | 2020-12-17 | Dataset |
Finite open-world query answering with number restrictions
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
| Characterizing definability in decidable fixpoint logics | 2020-05-27 | Paper |
Monadic Datalog, tree validity, and limited access containment
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
scientific article; zbMATH DE number 7104937 (Why is no real title available?)
(available as arXiv preprint) | 2019-09-13 | Paper |
Logical foundations of information disclosure in ontology-based data integration
Artificial Intelligence | 2019-01-18 | Paper |
SOME MODEL THEORY OF GUARDED NEGATION
Journal of Symbolic Logic | 2019-01-04 | Paper |
Query answering with transitive and linear-ordered data
Journal of Artificial Intelligence Research | 2018-11-01 | Paper |
Effective interpolation and preservation in guarded logics
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 |
The complexity of boundedness for guarded logics
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Finite Open-World Query Answering with Number Restrictions
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Interpolation with decidable fixpoint logics
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Querying visible and invisible information
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
A Step Up in Expressiveness of Decidable Fixpoint Logics
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Complexity of two-variable logic on finite trees
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Effective interpolation and preservation in guarded logics
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Limiting Until in ordered tree query languages
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Bisimilarity of pushdown automata is nonelementary
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Determinacy and rewriting of functional top-down and MSO tree transformations
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Generating plans from proofs. The interpolation-based approach to query reformulation
Synthesis Lectures on Data Management | 2016-04-08 | Paper |
Relational queries over interpreted structures
Journal of the ACM | 2015-12-17 | Paper |
Definable relations and first-order query languages over strings
Journal of the ACM | 2015-11-12 | Paper |
The complexity of higher-order queries
Information and Computation | 2015-09-28 | Paper |
Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
The per-character cost of repairing word languages
Theoretical Computer Science | 2014-06-06 | Paper |
Databases
Computer Science | 2014-02-21 | Paper |
Bounded repairability of word languages
Journal of Computer and System Sciences | 2014-01-27 | Paper |
Rewriting Guarded Negation Queries
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Determinacy and Rewriting of Top-Down and MSO Tree Transformations
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Complexity of two-variable logic on finite trees
Automata, Languages, and Programming | 2013-08-07 | Paper |
LTL model checking of interval Markov chains
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Two variable vs. linear temporal logic in model checking and games
Logical Methods in Computer Science | 2013-06-20 | Paper |
Monadic Datalog Containment
Automata, Languages, and Programming | 2012-11-01 | Paper |
Two variable vs. linear temporal logic in model checking and games
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
The Cost of Traveling between Languages
Automata, Languages and Programming | 2011-07-07 | Paper |
Automata vs. Logics on Data Words
Computer Science Logic | 2010-09-03 | Paper |
Towards a characterization of order-invariant queries over tame graphs
Journal of Symbolic Logic | 2009-03-25 | Paper |
A characterization of first-order topological properties of planar spatial data
Journal of the ACM | 2008-12-21 | Paper |
XPath satisfiability in the presence of DTDs
Journal of the ACM | 2008-12-21 | Paper |
Efficient and Expressive Tree Filters
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Interpreting Tree-to-Tree Queries
Automata, Languages and Programming | 2007-09-11 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Database Programming Languages
Lecture Notes in Computer Science | 2006-10-20 | Paper |
| scientific article; zbMATH DE number 5038454 (Why is no real title available?) | 2006-07-03 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2006-01-10 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Algebraic Methodology and Software Technology
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Structural properties of XPath fragments
Theoretical Computer Science | 2005-06-10 | Paper |
Definability with a predicate for a semi-linear set
Journal of Symbolic Logic | 2004-03-25 | Paper |
| scientific article; zbMATH DE number 1953125 (Why is no real title available?) | 2003-07-25 | Paper |
Reachability and connectivity queries in constraint databases
Journal of Computer and System Sciences | 2003-06-25 | Paper |
Aggregate operators in constraint query languages
Journal of Computer and System Sciences | 2002-09-12 | Paper |
| scientific article; zbMATH DE number 1754627 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1670479 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1515856 (Why is no real title available?) | 2000-10-10 | Paper |
| scientific article; zbMATH DE number 1515858 (Why is no real title available?) | 2000-10-10 | Paper |
Stability theory, permutations of indiscernibles, and embedded finite models
Transactions of the American Mathematical Society | 2000-10-03 | Paper |
Safe Constraint Queries
SIAM Journal on Computing | 2000-03-19 | Paper |
Hierarchies of measure-theoretic ultrafilters
Annals of Pure and Applied Logic | 2000-03-13 | Paper |
| scientific article; zbMATH DE number 1392296 (Why is no real title available?) | 2000-01-24 | Paper |
| scientific article; zbMATH DE number 841148 (Why is no real title available?) | 1999-10-28 | Paper |
Ultrafilters which extend measures
Journal of Symbolic Logic | 1999-04-27 | Paper |
Verifiable properties of database transactions
Information and Computation | 1999-03-22 | Paper |
Relational expressive power of constraint query languages
Journal of the ACM | 1998-12-10 | Paper |
| scientific article; zbMATH DE number 1086488 (Why is no real title available?) | 1997-11-13 | Paper |
