| Publication | Date of Publication | Type |
|---|
Preservation theorems for Tarski's relation algebra
Logical Methods in Computer Science | 2024-11-12 | Paper |
Craig interpolation for decidable first-order fragments
| 2024-10-30 | Paper |
Characterising modal formulas with examples
ACM Transactions on Computational Logic | 2024-04-25 | Paper |
On the non-efficient PAC learnability of conjunctive queries
Information Processing Letters | 2023-10-12 | Paper |
Local dependence and guarding
| 2023-03-24 | Paper |
Recursive Programs for Document Spanners
| 2022-07-21 | Paper |
Local Dependence and Guarding
| 2022-06-13 | Paper |
Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Generating plans from proofs
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Approximation algorithms for schema-mapping discovery from data examples
ACM Transactions on Database Systems | 2021-11-25 | Paper |
SOME MODEL THEORY OF GUARDED NEGATION
Journal of Symbolic Logic | 2019-01-04 | Paper |
Interpolation with decidable fixpoint logics
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 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 |
Querying visible and invisible information
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | 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 |
Declarative probabilistic programming with Datalog
| 2017-07-14 | Paper |
Effective interpolation and preservation in guarded logics
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
The product homomorphism problem and applications
| 2017-06-13 | Paper |
On the data complexity of consistent query answering
Theory of Computing Systems | 2016-04-18 | Paper |
Generating plans from proofs. The interpolation-based approach to query reformulation
Synthesis Lectures on Data Management | 2016-04-08 | Paper |
Guarded negation
Journal of the ACM | 2016-03-24 | Paper |
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM | 2015-11-11 | Paper |
Learning schema mappings
ACM Transactions on Database Systems | 2015-09-03 | Paper |
Schema mappings: a case of logical dynamics in database theory
Outstanding Contributions to Logic | 2015-05-11 | Paper |
scientific article; zbMATH DE number 6302902 (Why is no real title available?)
| 2014-06-11 | Paper |
On the equivalence of distributed systems with queries and communication
Journal of Computer and System Sciences | 2014-01-20 | Paper |
Topological perspective on the hybrid proof rules
Electronic Notes in Theoretical Computer Science | 2013-12-20 | Paper |
Beth definability in expressive description logics
The Journal of Artificial Intelligence Research (JAIR) | 2013-11-28 | Paper |
Unary negation
Logical Methods in Computer Science | 2013-09-26 | Paper |
Rewriting Guarded Negation Queries
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
On core xpath with inflationary fixed points
RAIRO. Theoretical Informatics and Applications | 2013-08-13 | Paper |
The dynamics of information exchange dialogues
Electronic Notes in Theoretical Computer Science | 2013-05-24 | Paper |
Complete axiomatizations of fragments of monadic second-order logic on finite trees
Logical Methods in Computer Science | 2013-01-07 | Paper |
Some modal aspects of XPath
Journal of Applied Non-Classical Logics | 2012-07-17 | Paper |
Unary negation
| 2012-01-23 | Paper |
Characterizing EF over infinite trees and modal logic on transitive graphs
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Guarded negation
Automata, Languages and Programming | 2011-07-07 | Paper |
A note on the expressibility problem for modal logics and star-free regular expressions
Information Processing Letters | 2010-08-16 | Paper |
Transitive closure logic, nested tree walking automata, and XPath
Journal of the ACM | 2010-07-14 | Paper |
Complete axiomatizations for XPath fragments
Journal of Applied Logic | 2010-06-11 | Paper |
An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Craig Interpolation for Linear Temporal Languages
Computer Science Logic | 2009-11-12 | Paper |
Lindstrom theorems for fragments of first-order logic
Logical Methods in Computer Science | 2009-08-20 | Paper |
Axiomatizing the logical core of XPath 2.0
Theory of Computing Systems | 2009-08-06 | Paper |
Modal languages for topology: expressivity and definability
Annals of Pure and Applied Logic | 2009-06-10 | Paper |
Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees
Logical Foundations of Computer Science | 2009-02-24 | Paper |
Multimodal logics of products of topologies
Studia Logica | 2007-01-29 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Expressivity of second order propositional modal logic
Journal of Philosophical Logic | 2006-08-14 | Paper |
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
Journal Of Logic And Computation | 2006-07-03 | Paper |
Interpolation for extended modal languages
Journal of Symbolic Logic | 2006-02-08 | Paper |
Hybrid logics with Sahlqvist axioms
Logic Journal of the IGPL | 2005-10-18 | Paper |
Guarded fragments with constants
Journal of Logic, Language and Information | 2005-10-04 | Paper |
scientific article; zbMATH DE number 1950266 (Why is no real title available?)
| 2003-07-17 | Paper |
