The following pages link to Floris Geerts (Q359885):
Displayed 31 items.
- Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
- First-order under-approximations of consistent query answers (Q518631) (← links)
- Relational completeness of query languages for annotated databases (Q532367) (← links)
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases (Q555774) (← links)
- On database query languages for K-relations (Q975870) (← links)
- Topological formulation of termination properties of iterates of functions (Q1029041) (← links)
- Expressing the box cone radius in the relational calculus with real polynomial constraints (Q1422229) (← links)
- On the expressive power of linear algebra on graphs (Q2035472) (← links)
- Correction to: ``On the expressive power of linear algebra on graphs'' (Q2035473) (← links)
- On the expressive power of message-passing neural networks as global feature map transformers (Q2103899) (← links)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661) (← links)
- Foundations of Data Quality Management (Q2902054) (← links)
- Algebraic Structures for Capturing the Provenance of SPARQL Queries (Q3177765) (← links)
- On the Expressive Power of Query Languages for Matrices (Q3305355) (← links)
- XPath satisfiability in the presence of DTDs (Q3546365) (← links)
- (Q4414535) (← links)
- (Q4473167) (← links)
- Capturing Missing Tuples and Missing Values (Q5012552) (← links)
- Bounded Query Rewriting Using Views (Q5012589) (← links)
- (Q5091117) (← links)
- Topological elementary equivalence of regular semi‐algebraic sets in three‐dimensional space (Q5109238) (← links)
- First-order complete and computationally complete query languages for spatio-temporal databases (Q5277802) (← links)
- On the Complexity of Package Recommendation Problems (Q5396952) (← links)
- Discovery Science (Q5464542) (← links)
- Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases (Q5470739) (← links)
- Database Programming Languages (Q5493336) (← links)
- (Q5714257) (← links)
- (Q5714258) (← links)
- Constraint Databases (Q5717749) (← links)
- When Can Matrix Query Languages Discern Matrices (Q5874366) (← links)
- The expressive power of kth-order invariant graph networks (Q6345708) (← links)