| Publication | Date of Publication | Type |
|---|
| Expressive completeness of two-variable first-order logic with counting for first-order logic queries on rooted unranked trees | 2026-02-27 | Paper |
Preservation theorems for Tarski's relation algebra
Logical Methods in Computer Science | 2024-11-12 | Paper |
Executable first-order queries in the logic of information flows
Logical Methods in Computer Science | 2024-06-27 | Paper |
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
Logical Methods in Computer Science | 2024-03-11 | Paper |
Inputs, Outputs, and Composition in the Logic of Information Flows
ACM Transactions on Computational Logic | 2023-11-03 | Paper |
DNAQL: a query language for DNA sticker complexes
Natural Computing | 2023-09-08 | Paper |
SHACL: a description logic in disguise
(available as arXiv preprint) | 2023-04-04 | Paper |
On the expressive power of message-passing neural networks as global feature map transformers
(available as arXiv preprint) | 2022-12-09 | Paper |
A computational model for generic graph functions
Graph Transformations in Computer Science | 2022-08-16 | Paper |
scientific article; zbMATH DE number 7533347 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-28 | Paper |
On matrices and \(K\)-relations
Annals of Mathematics and Artificial Intelligence | 2022-02-14 | Paper |
Discovering XSD Keys from XML Data
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Subsequence versus substring constraints in sequence pattern languages
Acta Informatica | 2021-04-28 | Paper |
Descriptive complexity of deterministic polylogarithmic time and space
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Descriptive complexity of real computation and probabilistic independence logic
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Descriptive complexity of real computation and probabilistic independence logic
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| scientific article; zbMATH DE number 7297870 (Why is no real title available?) | 2021-01-19 | Paper |
On matrices and \(K\)-relations
Lecture Notes in Computer Science | 2020-10-26 | Paper |
On the expressive power of query languages for matrices
(available as arXiv preprint) | 2020-08-06 | Paper |
Descriptive complexity of deterministic polylogarithmic time
(available as arXiv preprint) | 2020-03-04 | Paper |
A framework for comparing query languages in their ability to express Boolean queries
Annals of Mathematics and Artificial Intelligence | 2019-12-09 | Paper |
A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
Information Processing Letters | 2019-09-20 | Paper |
Positive neural networks in discrete time implement monotone-regular behaviors
Neural Computation | 2019-06-04 | 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 |
| 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
Lecture Notes in Computer Science | 2018-06-26 | Paper |
Putting logic-based distributed systems on stable grounds
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
| Inference in the \(\mathrm{FO(C)}\) modelling language | 2017-07-18 | Paper |
Inference in the \(\mathrm{FO(C)}\) modelling language
(available as arXiv preprint) | 2017-07-18 | Paper |
Polymorphic type inference for the named nested relational calculus
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Relative expressive power of navigational querying on graphs
Information Sciences | 2017-05-16 | Paper |
Relative expressive power of navigational querying on graphs
Information Sciences | 2017-05-16 | Paper |
On the satisfiability problem for SPARQL patterns
The Journal of Artificial Intelligence Research (JAIR) | 2016-09-07 | Paper |
Deciding confluence for a simple class of relational transducer networks
Theory of Computing Systems | 2016-04-18 | Paper |
Graph-theoretic formalization of hybridization in DNA sticker complexes
Natural Computing | 2016-03-10 | Paper |
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM | 2015-10-30 | 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 |
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations
Journal Of Logic And Computation | 2015-07-15 | Paper |
Inconsistency-tolerant reasoning with OWL DL
International Journal of Approximate Reasoning | 2015-07-10 | 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 |
Positive Dedalus programs tolerate non-causality
Journal of Computer and System Sciences | 2014-06-10 | Paper |
On the primitivity of operators in SPARQL
Information Processing Letters | 2014-05-05 | Paper |
Relational transducers for declarative networking
Journal of the ACM | 2014-02-17 | Paper |
The navigational power of web browsers
Theory of Computing Systems | 2012-12-06 | Paper |
A type system for DNAQL
Lecture Notes in Computer Science | 2012-11-06 | 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 |
A formal model for databases in DNA
Algebraic and Numeric Biology | 2012-06-08 | Paper |
A comparison of graph-theoretic DNA hybridization models
Theoretical Computer Science | 2012-05-30 | Paper |
| Logical aspects of spatial databases | 2011-10-05 | Paper |
Graph-theoretic formalization of hybridization in DNA sticker complexes
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Relational completeness of query languages for annotated databases
Journal of Computer and System Sciences | 2011-05-04 | Paper |
Database Theory, Yuri, and Me
Fields of Logic and Computation | 2010-09-03 | Paper |
Induction of relational algebra expressions
Inductive Logic Programming | 2010-08-24 | Paper |
| scientific article; zbMATH DE number 5605073 (Why is no real title available?) | 2009-09-19 | Paper |
Database query processing using finite cursor machines
Theory of Computing Systems | 2009-08-06 | Paper |
On the expressive power of semijoin queries
Information Processing Letters | 2009-07-21 | Paper |
Repetitions and permutations of columns in the semijoin algebra
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Repetitions and permutations of columns in the semijoin algebra
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
Learning \((k,l)\)-contextual tree languages for information extraction from web pages
Machine Learning | 2009-03-31 | Paper |
A characterization of first-order topological properties of planar spatial data
Journal of the ACM | 2008-12-21 | Paper |
Applying an update method to a set of receivers
ACM Transactions on Database Systems | 2008-06-18 | Paper |
On the complexity of division and set joins in the relational algebra
Journal of Computer and System Sciences | 2007-05-23 | Paper |
Well-definedness and semantic type-checking for the nested relational calculus
Theoretical Computer Science | 2007-03-12 | Paper |
Foundations of Information and Knowledge Systems
Lecture Notes in Computer Science | 2007-02-12 | Paper |
On the tree-transformation power of XSLT
Acta Informatica | 2007-01-05 | Paper |
Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases
SIAM Journal on Computing | 2006-06-01 | Paper |
\(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets
Acta Informatica | 2005-12-14 | Paper |
The semijoin algebra and the guarded fragment
Journal of Logic, Language and Information | 2005-10-04 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Solving Equations in the Relational Algebra
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2086669 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1953136 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1943770 (Why is no real title available?) | 2003-07-01 | Paper |
| scientific article; zbMATH DE number 1934563 (Why is no real title available?) | 2003-06-25 | Paper |
Abstract state machines and computationally complete query languages
Information and Computation | 2003-01-14 | Paper |
Adding for-loops to first-order logic
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1841810 (Why is no real title available?) | 2002-12-04 | Paper |
Polymorphic type inference for the relational algebra
Journal of Computer and System Sciences | 2002-09-12 | Paper |
Topological elementary equivalence of closed semi-algebraic sets in the real plane
The Journal of Symbolic Logic | 2001-12-07 | Paper |
| scientific article; zbMATH DE number 1670504 (Why is no real title available?) | 2001-11-11 | Paper |
Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1515855 (Why is no real title available?) | 2001-06-18 | Paper |
Typed query languages for databases containing queries
Information Systems | 2000-03-19 | Paper |
Temporal connectives versus explicit timestamps to query temporal databases
Journal of Computer and System Sciences | 2000-02-17 | Paper |
Complete geometric query languages
Journal of Computer and System Sciences | 1999-11-09 | Paper |
Converting untyped formulas to typed ones
Acta Informatica | 1999-04-26 | Paper |
| scientific article; zbMATH DE number 1256674 (Why is no real title available?) | 1999-04-22 | Paper |
First-Order Queries on Finite Structures Over the Reals
SIAM Journal on Computing | 1998-09-21 | Paper |
Expressiveness and complexity of generic graph machines
Theory of Computing Systems | 1998-06-08 | Paper |
On the completeness of object-creating database transformation languages
Journal of the ACM | 1998-02-17 | Paper |
Complex object multi-level fixpoint queries.
Annals of Mathematics and Artificial Intelligence | 1997-05-13 | Paper |
A semideterministic approach to object creation and nondeterminism in database queries
Journal of Computer and System Sciences | 1997-03-18 | Paper |
The expressive power of cardinality-bounded set values in object-based data models
Theoretical Computer Science | 1997-02-28 | Paper |
First-order queries on databases embedded in an infinite structure
Information Processing Letters | 1997-02-27 | Paper |
Reflective programming in the relational algebra
Journal of Computer and System Sciences | 1996-11-26 | Paper |
The expressive power of complex values in object-based data models
Information and Computation | 1995-10-29 | Paper |
On minimizing the \(\forall\)-\(\neg\) degree of a connective-free formula
Acta Informatica | 1995-06-13 | Paper |
| scientific article; zbMATH DE number 8791 (Why is no real title available?) | 1992-06-25 | Paper |
