TREES: A Graphical Model for Querying Hierarchical Databases. - Jan Paredaens; Jan Van den Bussche (FMLDO, 1989)

Working Group Report: Negation, Functions and Construction in Rule-Based Languages for Complex Objects. - Peter Sander; Simone Rehm; Jan Van den Bussche (FMLDO, 1989)

Using SQL with Object-Oriented Databases (Preliminary Report). - Andreas Heuer 001; Jan Van den Bussche (FMLDO, 1990)

A formal basis for extending SQL to object-oriented databases. - Jan Van den Bussche (Bull. EATCS, 1990)

Evaluation and optimization of complex object selections. - Jan Van den Bussche (DOOD, 1991)

Active Complex Object Databases (Working Paper). - Jan Van den Bussche (FMLDO, 1991)

The Expressive Power of Structured Values in Pure OODB's. - Jan Van den Bussche; Jan Paredaens (PODS, 1991)

Concepts for Graph-Oriented Object Manipulation. - Marc Andries; Marc Gemis; Jan Paredaens; Inge Thyssens; Jan Van den Bussche (EDBT, 1992)

Non-Deterministic Aspects of Object-Creating Database Transformations. - Jan Van den Bussche; Dirk Van Gucht (FMLDO, 1992)

On the Completeness of Object-Creating Query Languages (Extended Abstract) - Jan Van den Bussche; Dirk Van Gucht; Marc Andries; Marc Gyssens (FOCS, 1992)

A Graph- and Object-Oriented Counterpart for SQL. - Marc Andries; Jan Paredaens; Jan Van den Bussche (Future Databases, 1992)

A Hierarchy of Faithful Set Creation in Pure OODB's. - Jan Van den Bussche; Dirk Van Gucht (ICDT, 1992)

Semi-determinism. - Jan Van den Bussche; Dirk Van Gucht (PODS, 1992)

An Overview of GOOD. - Jan Paredaens; Jan Van den Bussche; Marc Andries; Marc Gemis; Marc Gyssens; Inge Thyssens; Dirk Van Gucht; Vijay M. Sarathy; Lawrence V. Saxton (SIGMOD Rec., 1992)

A Computational Model for Generic Graph Functions. - Marc Gemis; Jan Paredaens; Peter Peelman; Jan Van den Bussche (Dagstuhl Seminar on Graph Transformations in Computer Science, 1993)

An Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries. - Jan Van den Bussche; Gottfried Vossen (DOOD, 1993)

GOOD: AGraph-Oriented Object Database System. - Marc Gemis; Jan Paredaens; Inge Thyssens; Jan Van den Bussche (SIGMOD Conference, 1993)

On Minimizing the Forall-Not Degree of a Connective-Free Formula. - Jan Van den Bussche (Acta Informatica, 1993)

Complex Object Multi-Level Fixpoint Queries. - Jan Van den Bussche (Ann. Math. Artif. Intell., 1993)

Using SQL with object-oriented databases. - Jan Van den Bussche; Andreas Heuer 001 (Inf. Syst., 1993)

Expressiveness of Efficient Semi-Deterministic Choice Constructs. - Marc Gyssens; Jan Van den Bussche; Dirk Van Gucht (ICALP, 1994)

Towards a Theory of Spatial Database Queries. - Jan Paredaens; Jan Van den Bussche; Dirk Van Gucht (PODS, 1994)

A Graph-Oriented Object Database Model. - Marc Gyssens; Jan Paredaens; Jan Van den Bussche; Dirk Van Gucht (IEEE Trans. Knowl. Data Eng., 1994)

Deep Equality Revisited. - Serge Abiteboul; Jan Van den Bussche (DOOD, 1995)

Lossless Representation of Topological Spatial Data. - Bart Kuijpers; Jan Paredaens; Jan Van den Bussche (SSD, 1995)

Temporal Connectives versus Explicit Timestamps in Temporal Query Languages - Serge Abiteboul; Laurent Herr; Jan Van den Bussche (Temporal Databases, 1995)

The Expressive Power of Cardinality-Bounded Set Values in Object-Based Data Models. - Jan Van den Bussche; Dirk Van Gucht (Theor. Comput. Sci., 1995)

The Expressive Power of Complex Values in Object-Based Data Models - Jan Van den Bussche; Jan Paredaens (Inf. Comput., 1995)

Termination Properties of Spatial Datalog Programs. - Bart Kuijpers; Jan Paredaens; Marc Smits; Jan Van den Bussche (Logic in Databases, 1996)

Temporal Versus First-Order Logic to Query Temporal Databases. - Serge Abiteboul; Laurent Herr; Jan Van den Bussche (PODS, 1996)

First-Order Queries on Databases Embedded in an Infinite Structure. - Martin Otto 001; Jan Van den Bussche (Inf. Process. Lett., 1996)

Reflective Programming in the Relational Algebra. - Jan Van den Bussche; Dirk Van Gucht; Gottfried Vossen (J. Comput. Syst. Sci., 1996)

On Implementing Structured Document Query Facilities on Top of a DOOD. - Frank Neven; Jan Van den Bussche (DOOD, 1997)

On Topological Elementary Equivalence of Spatial Databases. - Bart Kuijpers; Jan Paredaens; Jan Van den Bussche (ICDT, 1997)

Complete Geometrical Query Languages. - Marc Gyssens; Jan Van den Bussche; Dirk Van Gucht (PODS, 1997)

On the completeness of object-creating database transformation languages. - Jan Van den Bussche; Dirk Van Gucht; Marc Andries; Marc Gyssens (J. ACM, 1997)

A Semideterministic Approach to Object Creation and Nondeterminism in Database Queries. - Jan Van den Bussche; Dirk Van Gucht (J. Comput. Syst. Sci., 1997)

Methods and views. - Jan Van den Bussche; Emmanuel Waller (BDA, 1998)

Topological Canonization of Planar Spatial Data and Its Incremental Maintenance. - Floris Geerts; Bart Kuijpers; Jan Van den Bussche (FMLDO, 1998)

Converting Untyped Formulas to Typed Ones. - Jan Van den Bussche; Luca Cabibbo (Acta Informatica, 1998)

Expressiveness and Complexity of Generic Graph Machines. - Marc Gemis; Jan Paredaens; Peter Peelman; Jan Van den Bussche (Theory Comput. Syst., 1998)

First-Order Queries on Finite Structures Over the Reals. - Jan Paredaens; Jan Van den Bussche; Dirk Van Gucht (SIAM J. Comput., 1998)

A priori versus a posteriori filtering of association rules. - Bart Goethals; Jan Van den Bussche (1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1999)

On Capturing First-Order Topological Properties of Planar Spatial Databases. - Bart Kuijpers; Jan Van den Bussche (ICDT, 1999)

Type Inference in the Polymorphic Relational Algebra. - Jan Van den Bussche; Emmanuel Waller (PODS, 1999)

Typed Query Languages for Databases Containing Queries. - Frank Neven; Jan Van den Bussche; Dirk Van Gucht; Gottfried Vossen (Inf. Syst., 1999)

Temporal Connectives Versus Explicit Timestamps to Query Temporal Databases. - Serge Abiteboul; Laurent Herr; Jan Van den Bussche (J. Comput. Syst. Sci., 1999)

Complete Geometric Query Languages. - Marc Gyssens; Jan Van den Bussche; Dirk Van Gucht (J. Comput. Syst. Sci., 1999)

Reminiscences on Influential Papers. - Kenneth A. Ross; Surajit Chaudhuri; Gösta Grahne; H. V. Jagadish; Jan Van den Bussche; Moshe Y. Vardi (SIGMOD Rec., 1999)

Constraint Databases, Queries, and Query Languages. - Jan Van den Bussche (Constraint Databases, 2000)

On Supporting Interactive Association Rule Mining. - Bart Goethals; Jan Van den Bussche (DaWaK, 2000)

Topological Elementary Equivalence of Closed Semi-Algebraic Sets in The Real Plane. - Bart Kuijpers; Jan Paredaens; Jan Van den Bussche (J. Symb. Log., 2000)

Constraint databases: A tutorial introduction. - Jan Van den Bussche (SIGMOD Rec., 2000)

Applications of Alfred Tarski's Ideas in Database Theory. - Jan Van den Bussche (CSL, 2001)

A Tight Upper Bound on the Number of Candidate Patterns. - Floris Geerts; Bart Goethals; Jan Van den Bussche (ICDM, 2001)

Interactive Constrained Association Rule Mining - Bart Goethals; Jan Van den Bussche (CoRR, 2001)

Adding For-Loops to First-Order Logic. - Frank Neven; Martin Otto 001; Jerzy Tyszkiewicz; Jan Van den Bussche (Inf. Comput., 2001)

Rewriting queries using views over monadic database schemas. - Jan Van den Bussche (Inf. Process. Lett., 2001)

Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions. - Jan Van den Bussche (Theor. Comput. Sci., 2001)

Applying an update method to a set of receivers. - Marc Andries; Luca Cabibbo; Jan Paredaens; Jan Van den Bussche (ACM Trans. Database Syst., 2001)

Relational Association Rules: Getting WARMeR. - Bart Goethals; Jan Van den Bussche (Pattern Detection and Discovery, 2002)

Navigating with a Browser. - Michal Bielecki; Jan Hidders; Jan Paredaens; Jerzy Tyszkiewicz; Jan Van den Bussche (ICALP, 2002)

Information Extraction in Structured Documents Using Tree Automata Induction. - Raymond Kosala; Jan Van den Bussche; Maurice Bruynooghe; Hendrik Blockeel (PKDD, 2002)

Distributed Computation of Web Queries Using Automata. - Marc Spielmann; Jerzy Tyszkiewicz; Jan Van den Bussche (PODS, 2002)

Abstract State Machines and Computationally Complete Query Languages. - Andreas Blass; Yuri Gurevich; Jan Van den Bussche (Inf. Comput., 2002)

Expressiveness of structured document query languages based on attribute grammars. - Frank Neven; Jan Van den Bussche (J. ACM, 2002)

Polymorphic Type Inference for the Relational Algebra. - Jan Van den Bussche; Emmanuel Waller (J. Comput. Syst. Sci., 2002)

Database Interrogation Using Conjunctive Queries. - Michal Bielecki; Jan Van den Bussche (ICDT, 2003)

Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference. - Raymond Kosala; Maurice Bruynooghe; Jan Van den Bussche; Hendrik Blockeel (IJCAI, 2003)

Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets - Floris Geerts; Lieven Smits; Jan Van den Bussche (CoRR, 2003)

Finite Cursor Machines in Database Query Processing. - Jan Van den Bussche (Abstract State Machines, 2004)

Meta-SQL: Towards Practical Meta-Querying. - Jan Van den Bussche; Stijn Vansummeren; Gottfried Vossen (EDBT, 2004)

A Characterization of First-Order Topological Properties of Planar Spatial Data. - Michael Benedikt; Christof Löding; Jan Van den Bussche; Thomas Wilke (PODS, 2004)

DTDs versus XML Schema: A Practical Study. - Geert Jan Bex; Frank Neven; Jan Van den Bussche (WebDB, 2004)

Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery - Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren (CoRR, 2004)

The semijoin algebra and the guarded fragment - Dirk Leinders; Jerzy Tyszkiewicz; Jan Van den Bussche (CoRR, 2004)

On the expressive power of semijoin queries. - Dirk Leinders; Jerzy Tyszkiewicz; Jan Van den Bussche (Inf. Process. Lett., 2004)

Solving Equations in the Relational Algebra. - Joachim Biskup; Jan Paredaens; Thomas Schwentick; Jan Van den Bussche (SIAM J. Comput., 2004)

Learning (k, l)-Contextual Tree Languages for Information Extraction. - Stefan Raeymaekers; Maurice Bruynooghe; Jan Van den Bussche (ECML, 2005)

Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery Extended Abstract. - Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren (ICDT, 2005)

Mining tree queries in a graph. - Bart Goethals; Eveline Hoekx; Jan Van den Bussche (KDD, 2005)

Petri Net + Nested Relational Calculus = Dataflow. - Jan Hidders; Natalia Kwasnikowska; Jacek Sroka; Jerzy Tyszkiewicz; Jan Van den Bussche (OTM Conferences (1), 2005)

N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets. - Floris Geerts; Lieven Smits; Jan Van den Bussche (Acta Informatica, 2005)

First-order Topology Properties. - Jan Van den Bussche (Bull. EATCS, 2005)

Towards practical meta-querying. - Jan Van den Bussche; Stijn Vansummeren; Gottfried Vossen (Inf. Syst., 2005)

The Semijoin Algebra and the Guarded Fragment. - Dirk Leinders; Maarten Marx; Jerzy Tyszkiewicz; Jan Van den Bussche (J. Log. Lang. Inf., 2005)

Tight upper bounds on the number of candidate patterns. - Floris Geerts; Bart Goethals; Jan Van den Bussche (ACM Trans. Database Syst., 2005)

The Semijoin Algebra. - Jan Van den Bussche (FoIKS, 2006)

On-line maintenance of simplified weighted graphs for efficient distance queries. - Floris Geerts; Peter Z. Revesz; Jan Van den Bussche (GIS, 2006)

Mining for Tree-Query Associations in a Graph. - Eveline Hoekx; Jan Van den Bussche (ICDM, 2006)

On-line topological simplification of weighted graphs - Floris Geerts; Peter Z. Revesz; Jan Van den Bussche (CoRR, 2006)

Information extraction from structured documents using k-testable tree automaton inference. - Raymond Kosala; Hendrik Blockeel; Maurice Bruynooghe; Jan Van den Bussche (Data Knowl. Eng., 2006)

A characterization of first-order topological properties of planar spatial data. - Michael Benedikt; Bart Kuijpers; Christof Löding; Jan Van den Bussche; Thomas Wilke (J. ACM, 2006)

Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases. - Floris Geerts; Bart Kuijpers; Jan Van den Bussche (SIAM J. Comput., 2006)

Database theory column: report on PODS 2006. - Jan Van den Bussche (SIGACT News, 2006)

Finding Clusters of Positive and Negative Coregulated Genes in Gene Expression Data. - Kerstin Koch; Stefan Schönauer; Ivy Jansen; Jan Van den Bussche; Tomasz Burzykowski (BIBE, 2007)

A Theory of Stream Queries. - Yuri Gurevich; Dirk Leinders; Jan Van den Bussche (DBPL, 2007)

A Formal Model of Dataflow Repositories. - Jan Hidders; Natalia Kwasnikowska; Jacek Sroka; Jerzy Tyszkiewicz; Jan Van den Bussche (DILS, 2007)

A crash course on database queries. - Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren (PODS, 2007)

On the tree-transformation power of XSLT. - Wim Janssen; Alexandr Korlyukov; Jan Van den Bussche (Acta Informatica, 2007)

Mining for trees in a graph is NP-complete - Jan Van den Bussche (CoRR, 2007)

On the complexity of division and set joins in the relational algebra. - Dirk Leinders; Jan Van den Bussche (J. Comput. Syst. Sci., 2007)

Well-definedness and semantic type-checking for the nested relational calculus. - Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren (Theor. Comput. Sci., 2007)

Polymorphic type inference for the named nested relational calculus. - Jan Van den Bussche; Stijn Vansummeren (ACM Trans. Comput. Log., 2007)

Introduction to the PODS 2006 special section. - Jan Van den Bussche (ACM Trans. Database Syst., 2007)

Mapping the NRC Dataflow Model to the Open Provenance Model. - Natalia Kwasnikowska; Jan Van den Bussche (IPAW, 2008)

DFL: A dataflow language based on Petri nets and nested relational calculus. - Jan Hidders; Natalia Kwasnikowska; Jacek Sroka; Jerzy Tyszkiewicz; Jan Van den Bussche (Inf. Syst., 2008)

Learning ( k , l )-contextual tree languages for information extraction from web pages. - Stefan Raeymaekers; Maurice Bruynooghe; Jan Van den Bussche (Mach. Learn., 2008)

Induction of Relational Algebra Expressions. - Joris J. M. Gillis; Jan Van den Bussche (ILP, 2009)

Context-free Graph Grammars as a Language-bias Mechanism for Graph Pattern Mining. - Christophe Costa Florêncio; Jan Ramon; Jonny Daenen; Jan Van den Bussche; Dries Van Dyck (MLG/SRL@ILP, 2009)

Repetitions and permutations of columns in the semijoin algebra. - Dirk Leinders; Jan Van den Bussche (RAIRO Theor. Informatics Appl., 2009)

Introduction to PODS 2006 special section. - Victor Vianu; Jan Van den Bussche (J. ACM, 2009)

Database Query Processing Using Finite Cursor Machines. - Martin Grohe; Yuri Gurevich; Dirk Leinders; Nicole Schweikardt; Jerzy Tyszkiewicz; Jan Van den Bussche (Theory Comput. Syst., 2009)

A Formal Model for Databases in DNA. - Joris J. M. Gillis; Jan Van den Bussche (ANB, 2010)

Database Theory, Yuri, and Me. - Jan Van den Bussche (Fields of Logic and Computation, 2010)

A Graph Model of Data and Workflow Provenance. - Umut A. Acar; Peter Buneman; James Cheney; Jan Van den Bussche; Natalia Kwasnikowska; Stijn Vansummeren (TaPP, 2010)

Mining tree-query associations in graphs - Eveline Hoekx; Jan Van den Bussche (CoRR, 2010)

Towards a theory of search queries. - George H. L. Fletcher; Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren (ACM Trans. Database Syst., 2010)

Logical aspects of spatial databases. - Bart Kuijpers; Jan Van den Bussche (Finite and Algorithmic Model Theory, 2011)

Relative expressive power of navigational querying on graphs. - George H. L. Fletcher; Marc Gyssens; Dirk Leinders; Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren; Yuqing Wu (ICDT, 2011)

Expressive Power of Safe First-Order Logical Decision Trees. - Joris J. M. Gillis; Jan Van den Bussche (ILP, 2011)

The Open Provenance Model core specification (v1.1). - Luc Moreau 001; Ben Clifford; Juliana Freire; Joe Futrelle; Yolanda Gil; Paul Groth; Natalia Kwasnikowska; Simon Miles; Paolo Missier; Jim Myers; Beth Plale; Yogesh Simmhan; et al. (Future Gener. Comput. Syst., 2011)

Relational completeness of query languages for annotated databases. - Floris Geerts; Jan Van den Bussche (J. Comput. Syst. Sci., 2011)

On the CRON Conjecture. - Tom J. Ameloot; Jan Van den Bussche (Datalog, 2012)

A Type System for DNAQL. - Robert Brijder; Joris J. M. Gillis; Jan Van den Bussche (DNA, 2012)

The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs. - George H. L. Fletcher; Marc Gyssens; Dirk Leinders; Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren; Yuqing Wu (FoIKS, 2012)

Deciding eventual consistency for a simple class of relational transducer networks. - Tom J. Ameloot; Jan Van den Bussche (ICDT, 2012)

The Navigational Power of Web Browsers. - Michal Bielecki; Jan Hidders; Jan Paredaens; Marc Spielmann; Jerzy Tyszkiewicz; Jan Van den Bussche (Theory Comput. Syst., 2012)

A comparison of graph-theoretic DNA hybridization models. - Robert Brijder; Joris J. M. Gillis; Jan Van den Bussche (Theor. Comput. Sci., 2012)

Quantitatively Evaluating Formula-Variable Relevance by Forgetting. - Xin Liang; Zuoquan Lin; Jan Van den Bussche (Canadian AI, 2013)

Well-Defined NRC Queries Can Be Typed - (Extended Abstract). - Jan Van den Bussche; Stijn Vansummeren (In Search of Elegance in the Theory and Practice of Computation, 2013)

Querying an Integrated Complex-Object Dataflow Database. - Natalia Kwasnikowska; Jan Van den Bussche (In Search of Elegance in the Theory and Practice of Computation, 2013)

The DNA query language DNAQL. - Robert Brijder; Joris J. M. Gillis; Jan Van den Bussche (ICDT, 2013)

Walk logic as a framework for path query languages on graph databases. - Jelle Hellings; Bart Kuijpers; Jan Van den Bussche; Xiaowang Zhang (ICDT, 2013)

On the expressive power of update primitives. - Tom J. Ameloot; Jan Van den Bussche; Emmanuel Waller (PODS, 2013)

Preface. - Jan Hidders; Paolo Missier; Jacek Sroka; Jan Van den Bussche (Fundam. Informaticae, 2013)

Relational transducers for declarative networking. - Tom J. Ameloot; Frank Neven; Jan Van den Bussche (J. ACM, 2013)

Graph-theoretic formalization of hybridization in DNA sticker complexes. - Robert Brijder; Joris J. M. Gillis; Jan Van den Bussche (Nat. Comput., 2013)

Inference in the FO(C) Modelling Language. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker; Jan Van den Bussche (ECAI, 2014)

FO(C) and Related Modelling Paradigms. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker; Jan Van den Bussche (CoRR, 2014)

FO(C): A Knowledge Representation Language of Causality. - Bart Bogaerts 001; Joost Vennekens; Marc Denecker; Jan Van den Bussche (CoRR, 2014)

Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference. - Tony Tan; Jan Van den Bussche; Xiaowang Zhang (CoRR, 2014)

On the satisfiability problem for SPARQL patterns. - Xiaowang Zhang; Jan Van den Bussche (CoRR, 2014)

Inconsistency-tolerant reasoning with OWL DL. - Xiaowang Zhang; Guohui Xiao 001; Zuoquan Lin; Jan Van den Bussche (Int. J. Approx. Reason., 2014)

On the primitivity of operators in SPARQL. - Xiaowang Zhang; Jan Van den Bussche (Inf. Process. Lett., 2014)

Positive Dedalus programs tolerate non-causality. - Tom J. Ameloot; Jan Van den Bussche (J. Comput. Syst. Sci., 2014)

Discovering XSD Keys from XML Data. - Marcelo Arenas; Jonny Daenen; Frank Neven; Martín Ugarte; Jan Van den Bussche; Stijn Vansummeren (ACM Trans. Database Syst., 2014)

Relative expressive power of downward fragments of navigational query languages on trees and chains. - Jelle Hellings; Marc Gyssens; Yuqing Wu; Dirk Van Gucht; Jan Van den Bussche; Stijn Vansummeren; George H. L. Fletcher (DBPL, 2015)

The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs. - George H. L. Fletcher; Marc Gyssens; Dirk Leinders; Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren; Yuqing Wu (Ann. Math. Artif. Intell., 2015)

On the Power of SPARQL in Expressing Navigational Queries. - Xiaowang Zhang; Jan Van den Bussche (Comput. J., 2015)

Convergence in Navigational Reinforcement Learning. - Tom J. Ameloot; Jan Van den Bussche (CoRR, 2015)

Relative expressive power of navigational querying on graphs using transitive closure. - Dimitri Surinx; George H. L. Fletcher; Marc Gyssens; Dirk Leinders; Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren; Yuqing Wu (Log. J. IGPL, 2015)

Relative expressive power of navigational querying on graphs. - George H. L. Fletcher; Marc Gyssens; Dirk Leinders; Dimitri Surinx; Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren; Yuqing Wu (Inf. Sci., 2015)

Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time. - Christophe Costa Florêncio; Jonny Daenen; Jan Ramon; Jan Van den Bussche; Dries Van Dyck (J. Univers. Comput. Sci., 2015)

Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. - George H. L. Fletcher; Marc Gyssens; Dirk Leinders; Jan Van den Bussche; Dirk Van Gucht; Stijn Vansummeren (J. Log. Comput., 2015)

Deciding Confluence for a Simple Class of Relational Transducer Networks. - Tom J. Ameloot; Jan Van den Bussche (Theory Comput. Syst., 2015)

Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors. - Tom J. Ameloot; Jan Van den Bussche (Neural Comput., 2015)

A Formal Account of the Open Provenance Model. - Natalia Kwasnikowska; Luc Moreau 001; Jan Van den Bussche (ACM Trans. Web, 2015)

2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award. - Marcelo Arenas; Peter Buneman; Jan Van den Bussche (PODS, 2016)

Learning with Value-Ramp. - Tom J. Ameloot; Jan Van den Bussche (CoRR, 2016)

On the Satisfiability Problem for SPARQL Patterns. - Xiaowang Zhang; Jan Van den Bussche; François Picalausa (J. Artif. Intell. Res., 2016)

Putting logic-based distributed systems on stable grounds. - Tom J. Ameloot; Jan Van den Bussche; William R. Marczak; Peter Alvaro; Joseph M. Hellerstein (Theory Pract. Log. Program., 2016)

Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries. - Angela Bonifati; Werner Nutt; Riccardo Torlone; Jan Van den Bussche (VLDB J., 2016)

The primitivity of operators in the algebra of binary relations under conjunctions of containments. - Dimitri Surinx; Jan Van den Bussche; Dirk Van Gucht (LICS, 2017)

J-Logic: Logical Foundations for JSON Querying. - Jan Hidders; Jan Paredaens; Jan Van den Bussche (PODS, 2017)

On the Satisfiability Problem of Patterns in SPARQL 1.1. - Xiaowang Zhang; Jan Van den Bussche; Kewen Wang 001; Zhe Wang 001 (AAAI, 2018)

Expressivity Within Second-Order Transitive-Closure Logic. - Flavio Ferrarotti; Jan Van den Bussche; Jonni Virtema (CSL, 2018)

Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees. - Jelle Hellings; Marc Gyssens; Yuqing Wu; Dirk Van Gucht; Jan Van den Bussche; Stijn Vansummeren; George H. L. Fletcher (CoRR, 2018)

Additive First-Order Queries. - Gerald Berger; Martin Otto 001; Andreas Pieris; Dimitri Surinx; Jan Van den Bussche (ICDT, 2019)

Fully Generic Queries: Open Problems and Some Partial Answers. - Dimitri Surinx; Jan Van den Bussche; Jonni Virtema (MEDI, 2019)

Descriptive Complexity of Deterministic Polylogarithmic Time. - Flavio Ferrarotti; Senén González; José Maria Turull Torres; Jan Van den Bussche; Jonni Virtema (WoLLIC, 2019)

A framework for comparing query languages in their ability to express boolean queries. - Dimitri Surinx; Jan Van den Bussche; Dirk Van Gucht (Ann. Math. Artif. Intell., 2019)

A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries. - Dimitri Surinx; Jan Van den Bussche (Inf. Process. Lett., 2019)

MATLANG: Matrix operations and their expressive power. - Robert Brijder; Floris Geerts; Jan Van den Bussche; Timmy Weerwag (SIGMOD Rec., 2019)

On the Expressive Power of Query Languages for Matrices. - Robert Brijder; Floris Geerts; Jan Van den Bussche; Timmy Weerwag (ACM Trans. Database Syst., 2019)

On the Expressivity of ASK Queries in SPARQL. - Xiaowang Zhang; Jan Van den Bussche; Kewen Wang 001; Heng Zhang 006; Xuanxing Yang; Zhiyong Feng 002 (AAAI, 2020)

Descriptive complexity of real computation and probabilistic independence logic. - Miika Hannula; Juha Kontinen; Jan Van den Bussche; Jonni Virtema (LICS, 2020)

2020 ACM PODS Alberto O. Mendelzon Test-of-Time Award. - Georg Gottlob; Jan Van den Bussche; Dirk Van Gucht (PODS, 2020)

J-Logic: a Logic for Querying JSON. - Jan Hidders; Jan Paredaens; Jan Van den Bussche (CoRR, 2020)

Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. - Jelle Hellings; Marc Gyssens; Yuqing Wu; Dirk Van Gucht; Jan Van den Bussche; Stijn Vansummeren; George H. L. Fletcher (Inf. Syst., 2020)

Input-Output Disjointness for Forward Expressions in the Logic of Information Flows. - Heba Aamer; Jan Van den Bussche (ICDT, 2021)

Subsequence versus substring constraints in sequence pattern languages. - Steven Engels; Tony Tan; Jan Van den Bussche (Acta Informatica, 2021)

Shape Fragments. - Thomas Delva; Anastasia Dimou; Maxime Jakubowski; Jan Van den Bussche (CoRR, 2021)

Descriptive complexity of deterministic polylogarithmic time and space. - Flavio Ferrarotti; Senén González; José Maria Turull Torres; Jan Van den Bussche; Jonni Virtema (J. Comput. Syst. Sci., 2021)

DNAQL: a query language for DNA sticker complexes. - Robert Brijder; Joris J. M. Gillis; Jan Van den Bussche (Nat. Comput., 2021)

Matrix Query Languages. - Floris Geerts; Thomas Muñoz; Cristian Riveros; Jan Van den Bussche; Domagoj Vrgoc (SIGMOD Rec., 2021)

What Can Database Query Processing Do for Instance-Spanning Constraints? - Heba Aamer; Marco Montali; Jan Van den Bussche (Business Process Management Workshops, 2022)

On the Expressive Power of Message-Passing Neural Networks as Global Feature Map Transformers. - Floris Geerts; Jasper Steegmans; Jan Van den Bussche (FoIKS, 2022)

Expressiveness of SHACL Features. - Bart Bogaerts 001; Maxime Jakubowski; Jan Van den Bussche (ICDT, 2022)

SHACL: A Description Logic in Disguise. - Bart Bogaerts 001; Maxime Jakubowski; Jan Van den Bussche (LPNMR, 2022)

On matrices and K-relations. - Robert Brijder; Marc Gyssens; Jan Van den Bussche (Ann. Math. Artif. Intell., 2022)

Data Provenance for SHACL. - Thomas Delva; Anastasia Dimou; Maxime Jakubowski; Jan Van den Bussche (EDBT, 2023)

Learning Graph Neural Networks using Exact Compression. - Jeroen Bollen; Jasper Steegmans; Jan Van den Bussche; Stijn Vansummeren (GRADES-NDA@SIGMOD, 2023)

Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees. - Jelle Hellings; Marc Gyssens; Jan Van den Bussche; Dirk Van Gucht (LICS, 2023)

POD-QUERY: Schema Mapping and Query Rewriting for Solid Pods. - Maarten Vandenbrande; Maxime Jakubowski; Pieter Bonte; Bart Buelens; Femke Ongenae; Jan Van den Bussche (ISWC (Posters/Demos/Industry), 2023)

Inputs, Outputs, and Composition in the Logic of Information Flows. - Heba Aamer; Bart Bogaerts 001; Dimitri Surinx; Eugenia Ternovska; Jan Van den Bussche (ACM Trans. Comput. Log., 2023)

The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024. - Martin Grohe; Jan Van den Bussche; Ke Yi 001 (PODS Companion, 2024)

What's in a Neighborhood? Describing Nodes in RDF Graphs Using Shapes. - Maxime Jakubowski; Jan Van den Bussche (RuleML+RR, 2024)

Compiling SHACL Into SQL. - Maxime Jakubowski; Jan Van den Bussche (ISWC (2), 2024)

A methodological approach to incremental view maintenance for optimizing SPARQL queries in Solid. - Dore Staquet; Bart Buelens; Jan Van den Bussche (SoSy, 2024)

Shapes in Graph Data: Theory and Implementation (Dagstuhl Seminar 24102). - Shqiponja Ahmetaj; Slawomir Staworko; Jan Van den Bussche; Maxime Jakubowski (Dagstuhl Reports, 2024)

Preservation theorems for Tarski's relation algebra. - Bart Bogaerts 001; Balder ten Cate; Brett McLean; Jan Van den Bussche (Log. Methods Comput. Sci., 2024)

Executable First-Order Queries in the Logic of Information Flows. - Heba Aamer; Bart Bogaerts 001; Dimitri Surinx; Eugenia Ternovska; Jan Van den Bussche (Log. Methods Comput. Sci., 2024)

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests. - Bart Bogaerts 001; Maxime Jakubowski; Jan Van den Bussche (Log. Methods Comput. Sci., 2024)

Postulates for Provenance: Instance-based provenance for first-order logic. - Bart Bogaerts 001; Maxime Jakubowski; Jan Van den Bussche (Proc. ACM Manag. Data, 2024)

Toward a Solid Acceptance of the Decentralized Web of Personal Data: Societal and Technological Convergence. - Ana Pop Stefanija; Bart Buelens; Elfi Goesaert; Tom Lenaerts; Jo Pierson; Jan Van den Bussche (Commun. ACM, 2024)

Temporal graph patterns by timed automata. - Amir Aghasadeghi; Jan Van den Bussche; Julia Stoyanovich (VLDB J., 2024)

SQL4NN: Validation and Expressive Querying of Models as Data. - Mark Gerarts; Juno Steegmans; Jan Van den Bussche (DEEM@SIGMOD, 2025)

Query Languages for Neural Networks. - Martin Grohe; Christoph Standke; Juno Steegmans; Jan Van den Bussche (ICDT, 2025)

Halting Recurrent GNNs and the Graded μ-Calculus. - Jeroen Bollen; Jan Van den Bussche; Stijn Vansummeren; Jonni Virtema (CoRR, 2025)

The KG-ER Conceptual Schema Language. - Enrico Franconi; Benoît Groz; Jan Hidders; Nina Pardal; Slawek Staworko; Jan Van den Bussche; Piotr Wieczorek (CoRR, 2025)

Expressiveness within Sequence Datalog. - Heba Aamer; Jan Hidders; Jan Paredaens; Jan Van den Bussche (ACM Trans. Database Syst., 2025)