| Publication | Date of Publication | Type |
|---|
Optimizing multiset relational algebra queries using weak-equivalent rewrite rules
| 2022-12-09 | Paper |
On matrices and \(K\)-relations
Annals of Mathematics and Artificial Intelligence | 2022-02-14 | Paper |
On matrices and \(K\)-relations
Lecture Notes in Computer Science | 2020-10-26 | Paper |
First-order definable counting-only queries
Annals of Mathematics and Artificial Intelligence | 2019-12-09 | Paper |
Calculi for symmetric queries
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Expressiveness of efficient semi-deterministic choice constructs
Automata, Languages and Programming | 2019-04-29 | Paper |
Relative expressive power of navigational querying on graphs using transitive closure
Logic Journal of the IGPL | 2019-01-08 | Paper |
The power of Tarski's relation algebra on trees
| 2018-06-26 | Paper |
First-order definable counting-only queries
Lecture Notes in Computer Science | 2018-06-26 | Paper |
Relative expressive power of navigational querying on graphs
Information Sciences | 2017-05-16 | Paper |
Implication and axiomatization of functional and constant constraints
Annals of Mathematics and Artificial Intelligence | 2016-05-23 | Paper |
Structural characterizations of the navigational expressiveness of relation algebras on a tree
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations
Journal Of Logic And Computation | 2015-07-15 | Paper |
On the conditional independence implication problem: a lattice-theoretic approach
Artificial Intelligence | 2015-06-26 | Paper |
The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
Information Processing Letters | 2014-07-18 | Paper |
Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model
Lecture Notes in Computer Science | 2014-03-31 | Paper |
The impact of transitive closure on the Boolean expressiveness of navigational query languages on graphs
Lecture Notes in Computer Science | 2012-08-20 | Paper |
Regular expressions with counting: weak versus strong determinism
SIAM Journal on Computing | 2012-05-30 | Paper |
Logical and algorithmic properties of stable conditional independence
International Journal of Approximate Reasoning | 2010-07-20 | Paper |
Regular Expressions with Counting: Weak versus Strong Determinism
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation | 2008-08-14 | Paper |
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences | 2008-06-26 | Paper |
An expressive language for linear spatial database queries
Journal of Computer and System Sciences | 2005-02-23 | Paper |
Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
Information and Computation | 2003-01-14 | Paper |
On the expressiveness of linear-constraint query languages for spatial databases
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1515861 (Why is no real title available?)
| 2000-10-10 | Paper |
Corrigendum to: ``On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
Journal of Computer and System Sciences | 2000-07-25 | Paper |
On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
Journal of Computer and System Sciences | 1999-11-09 | Paper |
Complete geometric query languages
Journal of Computer and System Sciences | 1999-11-09 | Paper |
How to determine the expressive power of constraints
Constraints | 1999-09-07 | Paper |
scientific article; zbMATH DE number 1256674 (Why is no real title available?)
| 1999-04-22 | Paper |
Closure properties of constraints
Journal of the ACM | 1998-02-17 | Paper |
On the completeness of object-creating database transformation languages
Journal of the ACM | 1998-02-17 | Paper |
scientific article; zbMATH DE number 1113817 (Why is no real title available?)
| 1998-02-08 | Paper |
CGOOD, a categorical graph-oriented object data model
Theoretical Computer Science | 1997-02-27 | Paper |
scientific article; zbMATH DE number 718859 (Why is no real title available?)
| 1995-06-08 | Paper |
A Grammar-Based Approach Towards Unifying Hierarchical Data Models
SIAM Journal on Computing | 1995-04-06 | Paper |
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence | 1995-01-02 | Paper |
scientific article; zbMATH DE number 43047 (Why is no real title available?)
| 1993-01-23 | Paper |
The powerset algebra as a natural tool to handle nested database relations
Journal of Computer and System Sciences | 1993-01-16 | Paper |
A comparison between algebraic query languages for flat and nested databases
Theoretical Computer Science | 1992-06-26 | Paper |
On a hierarchy of classes for nested databases
Information Processing Letters | 1990-01-01 | Paper |
A uniform approach toward handling atomic and structured information in the nested relational database model
Journal of the ACM | 1989-01-01 | Paper |
An alternative way to represent the cogroup of a relation in the context of nested databases
Information Processing Letters | 1989-01-01 | Paper |
Object histories which avoid certain subsequences
Information and Computation | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4043317 (Why is no real title available?)
| 1987-01-01 | Paper |
On the complexity of join dependencies
ACM Transactions on Database Systems | 1986-01-01 | Paper |
Another view of functional and multivalued dependencies in the relational database model
International Journal of Computer & Information Sciences | 1983-01-01 | Paper |
