The following pages link to Jan Van den Bussche (Q256712):
Displaying 50 items.
- Graph-theoretic formalization of hybridization in DNA sticker complexes (Q256713) (← links)
- Deciding confluence for a simple class of relational transducer networks (Q269334) (← links)
- A comparison of graph-theoretic DNA hybridization models (Q418756) (← links)
- Relative expressive power of navigational querying on graphs (Q528686) (← links)
- Relational completeness of query languages for annotated databases (Q532367) (← links)
- The expressive power of cardinality-bounded set values in object-based data models (Q672334) (← links)
- A semideterministic approach to object creation and nondeterminism in database queries (Q676418) (← links)
- The navigational power of web browsers (Q692917) (← links)
- Polymorphic type inference for the relational algebra (Q696968) (← links)
- On the tree-transformation power of XSLT (Q855270) (← links)
- Well-definedness and semantic type-checking for the nested relational calculus (Q870267) (← links)
- On the complexity of division and set joins in the relational algebra (Q882434) (← links)
- Learning \((k,l)\)-contextual tree languages for information extraction from web pages (Q1009259) (← links)
- Converting untyped formulas to typed ones (Q1284693) (← links)
- Temporal connectives versus explicit timestamps to query temporal databases (Q1305921) (← links)
- Complete geometric query languages (Q1307692) (← links)
- On minimizing the \(\forall\)-\(\neg\) degree of a connective-free formula (Q1323356) (← links)
- First-order queries on databases embedded in an infinite structure (Q1350000) (← links)
- Complex object multi-level fixpoint queries. (Q1353951) (← links)
- (Q1387822) (redirect page) (← links)
- Expressiveness and complexity of generic graph machines (Q1387823) (← links)
- Well-defined NRC queries can be typed (extended abstract) (Q1799317) (← links)
- Adding for-loops to first-order logic (Q1854443) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- The expressive power of complex values in object-based data models (Q1898461) (← links)
- Reflective programming in the relational algebra (Q1924387) (← links)
- Typed query languages for databases containing queries (Q1969759) (← links)
- Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
- On the expressive power of message-passing neural networks as global feature map transformers (Q2103899) (← links)
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs (Q2254638) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries (Q2274499) (← links)
- Descriptive complexity of deterministic polylogarithmic time (Q2303589) (← links)
- Inconsistency-tolerant reasoning with OWL DL (Q2353974) (← links)
- On the expressive power of semijoin queries (Q2390289) (← links)
- On the primitivity of operators in SPARQL (Q2448857) (← links)
- Positive Dedalus programs tolerate non-causality (Q2453541) (← links)
- The semijoin algebra and the guarded fragment (Q2567344) (← links)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- SHACL: a description logic in disguise (Q2694553) (← links)
- Topological elementary equivalence of closed semi-algebraic sets in the real plane (Q2710595) (← links)
- (Q2753700) (← links)
- On the Satisfiability Problem for SPARQL Patterns (Q2818228) (← links)
- A Formal Model for Databases in DNA (Q2889699) (← links)
- The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs (Q2902490) (← links)
- Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes (Q3092332) (← links)
- (Q3172382) (← links)
- Expressiveness of structured document query languages based on attribute grammars (Q3196635) (← links)
- On the Expressive Power of Query Languages for Matrices (Q3305355) (← links)
