| Publication | Date of Publication | Type |
|---|
| Preservation theorems for Tarski's relation algebra | 2024-11-12 | Paper |
| Executable first-order queries in the logic of information flows | 2024-06-27 | Paper |
| Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests | 2024-03-11 | Paper |
| Inputs, Outputs, and Composition in the Logic of Information Flows | 2023-11-03 | Paper |
| DNAQL: a query language for DNA sticker complexes | 2023-09-08 | Paper |
| SHACL: a description logic in disguise | 2023-04-04 | Paper |
| On the expressive power of message-passing neural networks as global feature map transformers | 2022-12-09 | Paper |
| A computational model for generic graph functions | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5079746 | 2022-05-28 | Paper |
| On matrices and \(K\)-relations | 2022-02-14 | Paper |
| Discovering XSD Keys from XML Data | 2021-11-25 | Paper |
| Subsequence versus substring constraints in sequence pattern languages | 2021-04-28 | Paper |
| Descriptive complexity of deterministic polylogarithmic time and space | 2021-04-14 | Paper |
| Descriptive complexity of real computation and probabilistic independence logic | 2021-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144669 | 2021-01-19 | Paper |
| On matrices and \(K\)-relations | 2020-10-26 | Paper |
| On the Expressive Power of Query Languages for Matrices | 2020-08-06 | Paper |
| Descriptive complexity of deterministic polylogarithmic time | 2020-03-04 | Paper |
| A framework for comparing query languages in their ability to express Boolean queries | 2019-12-09 | Paper |
| A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries | 2019-09-20 | Paper |
| Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors | 2019-06-04 | Paper |
| Expressiveness of efficient semi-deterministic choice constructs | 2019-04-29 | Paper |
| Relative expressive power of navigational querying on graphs using transitive closure | 2019-01-08 | Paper |
| Well-defined NRC queries can be typed (extended abstract) | 2018-10-18 | Paper |
| A framework for comparing query languages in their ability to express Boolean queries | 2018-06-26 | Paper |
| Putting logic-based distributed systems on stable grounds | 2017-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282961 | 2017-07-18 | Paper |
| Polymorphic type inference for the named nested relational calculus | 2017-07-12 | Paper |
| Relative expressive power of navigational querying on graphs | 2017-05-16 | Paper |
| On the Satisfiability Problem for SPARQL Patterns | 2016-09-07 | Paper |
| Deciding confluence for a simple class of relational transducer networks | 2016-04-18 | Paper |
| Graph-theoretic formalization of hybridization in DNA sticker complexes | 2016-03-10 | Paper |
| Expressiveness of structured document query languages based on attribute grammars | 2015-10-30 | Paper |
| Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations | 2015-07-15 | Paper |
| Inconsistency-tolerant reasoning with OWL DL | 2015-07-10 | Paper |
| The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs | 2015-02-05 | Paper |
| Positive Dedalus programs tolerate non-causality | 2014-06-10 | Paper |
| On the primitivity of operators in SPARQL | 2014-05-05 | Paper |
| Relational transducers for declarative networking | 2014-02-17 | Paper |
| The navigational power of web browsers | 2012-12-06 | Paper |
| A Type System for DNAQL | 2012-11-06 | Paper |
| The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs | 2012-08-20 | Paper |
| A Formal Model for Databases in DNA | 2012-06-08 | Paper |
| A comparison of graph-theoretic DNA hybridization models | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172382 | 2011-10-05 | Paper |
| Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes | 2011-09-16 | Paper |
| Relational completeness of query languages for annotated databases | 2011-05-04 | Paper |
| Database Theory, Yuri, and Me | 2010-09-03 | Paper |
| Induction of Relational Algebra Expressions | 2010-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396570 | 2009-09-19 | Paper |
| Database query processing using finite cursor machines | 2009-08-06 | Paper |
| On the expressive power of semijoin queries | 2009-07-21 | Paper |
| Repetitions and permutations of columns in the semijoin algebra | 2009-05-06 | Paper |
| Learning \((k,l)\)-contextual tree languages for information extraction from web pages | 2009-03-31 | Paper |
| A characterization of first-order topological properties of planar spatial data | 2008-12-21 | Paper |
| Applying an update method to a set of receivers | 2008-06-18 | Paper |
| On the complexity of division and set joins in the relational algebra | 2007-05-23 | Paper |
| Well-definedness and semantic type-checking for the nested relational calculus | 2007-03-12 | Paper |
| Foundations of Information and Knowledge Systems | 2007-02-12 | Paper |
| On the tree-transformation power of XSLT | 2007-01-05 | Paper |
| Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases | 2006-06-01 | Paper |
| \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets | 2005-12-14 | Paper |
| The semijoin algebra and the guarded fragment | 2005-10-04 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Solving Equations in the Relational Algebra | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737206 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414539 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409794 | 2003-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4406033 | 2003-06-25 | Paper |
| Adding for-loops to first-order logic | 2003-01-14 | Paper |
| Abstract state machines and computationally complete query languages | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783298 | 2002-12-04 | Paper |
| Polymorphic type inference for the relational algebra | 2002-09-12 | Paper |
| Topological elementary equivalence of closed semi-algebraic sets in the real plane | 2001-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753700 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508935 | 2001-06-18 | Paper |
| Typed query languages for databases containing queries | 2000-03-19 | Paper |
| Temporal connectives versus explicit timestamps to query temporal databases | 2000-02-17 | Paper |
| Complete geometric query languages | 1999-11-09 | Paper |
| Converting untyped formulas to typed ones | 1999-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230361 | 1999-04-22 | Paper |
| First-Order Queries on Finite Structures Over the Reals | 1998-09-21 | Paper |
| Expressiveness and complexity of generic graph machines | 1998-06-08 | Paper |
| On the completeness of object-creating database transformation languages | 1998-02-17 | Paper |
| Complex object multi-level fixpoint queries. | 1997-05-13 | Paper |
| A semideterministic approach to object creation and nondeterminism in database queries | 1997-03-18 | Paper |
| The expressive power of cardinality-bounded set values in object-based data models | 1997-02-28 | Paper |
| First-order queries on databases embedded in an infinite structure | 1997-02-27 | Paper |
| Reflective programming in the relational algebra | 1996-11-26 | Paper |
| The expressive power of complex values in object-based data models | 1995-10-29 | Paper |
| On minimizing the \(\forall\)-\(\neg\) degree of a connective-free formula | 1995-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971280 | 1992-06-25 | Paper |
