Jan Van den Bussche

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 66

Top Venues

Publications

Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests. Log. Methods Comput. Sci. 20 (1) (2024)
Amir Aghasadeghi, Jan Van den Bussche, Julia Stoyanovich
Temporal graph patterns by timed automata. VLDB J. 33 (1) (2024)
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche
Executable First-Order Queries in the Logic of Information Flows. Log. Methods Comput. Sci. 20 (2) (2024)
Ana Pop Stefanija, Bart Buelens, Elfi Goesaert, Tom Lenaerts, Jo Pierson, Jan Van den Bussche
Toward a Solid Acceptance of the Decentralized Web of Personal Data: Societal and Technological Convergence. Commun. ACM 67 (1) (2024)
Martin Grohe, Jan Van den Bussche, Ke Yi
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024. PODS Companion (2024)
Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche
Postulates for Provenance: Instance-based provenance for first-order logic. Proc. ACM Manag. Data 2 (2) (2024)
Jeroen Bollen, Jasper Steegmans, Jan Van den Bussche, Stijn Vansummeren
Learning Graph Neural Networks using Exact Compression. CoRR (2023)
Jeroen Bollen, Jasper Steegmans, Jan Van den Bussche, Stijn Vansummeren
Learning Graph Neural Networks using Exact Compression. GRADES-NDA@SIGMOD (2023)
Jelle Hellings, Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht
Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees. LICS (2023)
Maarten Vandenbrande, Maxime Jakubowski, Pieter Bonte, Bart Buelens, Femke Ongenae, Jan Van den Bussche
POD-QUERY: Schema Mapping and Query Rewriting for Solid Pods. ISWC (Posters/Demos/Industry) (2023)
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche
Inputs, Outputs, and Composition in the Logic of Information Flows. ACM Trans. Comput. Log. 24 (4) (2023)
Bart Bogaerts, Balder ten Cate, Brett McLean, Jan Van den Bussche
Preservation theorems for Tarski's relation algebra. CoRR (2023)
Floris Geerts, Jasper Steegmans, Jan Van den Bussche
On the Expressive Power of Message-Passing Neural Networks as Global Feature Map Transformers. FoIKS (2022)
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche
Executable First-Order Queries in the Logic of Information Flows. CoRR (2022)
Heba Aamer, Jan Hidders, Jan Paredaens, Jan Van den Bussche
Expressiveness within Sequence Datalog. CoRR (2022)
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche
Inputs, Outputs, and Composition in the Logic of Information Flows. CoRR (2022)
Heba Aamer, Marco Montali, Jan Van den Bussche
What Can Database Query Processing Do for Instance-Spanning Constraints? CoRR (2022)
Thomas Delva, Anastasia Dimou, Maxime Jakubowski, Jan Van den Bussche
Data Provenance for SHACL. EDBT (2022)
Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests. CoRR (2022)
Robert Brijder, Marc Gyssens, Jan Van den Bussche
On matrices and K-relations. Ann. Math. Artif. Intell. 90 (2) (2022)
Heba Aamer, Marco Montali, Jan Van den Bussche
What Can Database Query Processing Do for Instance-Spanning Constraints? Business Process Management Workshops (2022)
Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche
Expressiveness of SHACL Features. ICDT (2022)
Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche
SHACL: A Description Logic in Disguise. LPNMR (2022)
Floris Geerts, Jasper Steegmans, Jan Van den Bussche
On the expressive power of message-passing neural networks as global feature map transformers. CoRR (2022)
Amir Pouya Aghasadeghi, Jan Van den Bussche, Julia Stoyanovich
Temporal graph patterns by timed automata. CoRR (2022)
Heba Aamer, Jan Hidders, Jan Paredaens, Jan Van den Bussche
Expressiveness within Sequence Datalog. PODS (2021)
Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche
SHACL: A Description Logic in Disguise. CoRR (2021)
Floris Geerts, Thomas Muñoz, Cristian Riveros, Jan Van den Bussche, Domagoj Vrgoc
Matrix Query Languages. SIGMOD Rec. 50 (3) (2021)
Steven Engels, Tony Tan, Jan Van den Bussche
Subsequence versus substring constraints in sequence pattern languages. Acta Informatica 58 (1-2) (2021)
Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche
DNAQL: a query language for DNA sticker complexes. Nat. Comput. 20 (1) (2021)
Heba Aamer, Jan Van den Bussche
Input-Output Disjointness for Forward Expressions in the Logic of Information Flows. ICDT (2021)
Thomas Delva, Anastasia Dimou, Maxime Jakubowski, Jan Van den Bussche
Shape Fragments. CoRR (2021)
Flavio Ferrarotti, Senén González, José Maria Turull Torres, Jan Van den Bussche, Jonni Virtema
Descriptive complexity of deterministic polylogarithmic time and space. J. Comput. Syst. Sci. 119 (2021)
Georg Gottlob, Jan Van den Bussche, Dirk Van Gucht
2020 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS (2020)
Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher
Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees. Inf. Syst. 89 (2020)
Robert Brijder, Marc Gyssens, Jan Van den Bussche
On Matrices and K-Relations. FoIKS (2020)
Jan Hidders, Jan Paredaens, Jan Van den Bussche
J-Logic: a Logic for Querying JSON. CoRR (2020)
Xiaowang Zhang, Jan Van den Bussche, Kewen Wang, Heng Zhang, Xuanxing Yang, Zhiyong Feng
On the Expressivity of ASK Queries in SPARQL. AAAI (2020)
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche
Inputs, Outputs, and Composition in the Logic of Information Flows. KR (2020)
Miika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema
Descriptive complexity of real computation and probabilistic independence logic. LICS (2020)
Miika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema
Descriptive complexity of real computation and probabilistic independence logic. CoRR (2020)
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche
Executable First-Order Queries in the Logic of Information Flows. ICDT (2020)
Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag
MATLANG: Matrix operations and their expressive power. SIGMOD Rec. 48 (1) (2019)
Robert Brijder, Marc Gyssens, Jan Van den Bussche
On matrices and K-relations. CoRR (2019)
Flavio Ferrarotti, Senén González, José Maria Turull Torres, Jan Van den Bussche, Jonni Virtema
Descriptive Complexity of Deterministic Polylogarithmic Time. CoRR (2019)
Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag
On the Expressive Power of Query Languages for Matrices. ACM Trans. Database Syst. 44 (4) (2019)
Flavio Ferrarotti, Senén González, José Maria Turull Torres, Jan Van den Bussche, Jonni Virtema
Descriptive Complexity of Deterministic Polylogarithmic Time. WoLLIC (2019)
Dimitri Surinx, Jan Van den Bussche, Jonni Virtema
Fully Generic Queries: Open Problems and Some Partial Answers. MEDI (2019)
Gerald Berger, Martin Otto, Andreas Pieris, Dimitri Surinx, Jan Van den Bussche
Additive First-Order Queries. ICDT (2019)
Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht
A framework for comparing query languages in their ability to express boolean queries. Ann. Math. Artif. Intell. 87 (1-2) (2019)
Dimitri Surinx, Jan Van den Bussche
A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries. Inf. Process. Lett. 150 (2019)
Xiaowang Zhang, Jan Van den Bussche, Kewen Wang, Zhe Wang
On the Satisfiability Problem of Patterns in SPARQL 1.1. AAAI (2018)
Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema
Expressivity within second-order transitive-closure logic. CoRR (2018)
Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht
A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries. FoIKS (2018)
Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher
Comparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees. CoRR (2018)
Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag
On the Expressive Power of Query Languages for Matrices. ICDT (2018)
Dimitri Surinx, Jan Van den Bussche
A Monotone Preservation Result for Boolean Queries Expressed as a Containment of Conjunctive Queries. CoRR (2018)
Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema
Expressivity Within Second-Order Transitive-Closure Logic. CSL (2018)
Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht
The primitivity of operators in the algebra of binary relations under conjunctions of containments. LICS (2017)
Jan Hidders, Jan Paredaens, Jan Van den Bussche
J-Logic: Logical Foundations for JSON Querying. PODS (2017)
Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag
On the expressive power of query languages for matrices. CoRR (2017)
Tom J. Ameloot, Jan Van den Bussche, William R. Marczak, Peter Alvaro, Joseph M. Hellerstein
Putting logic-based distributed systems on stable grounds. Theory Pract. Log. Program. 16 (4) (2016)
Angela Bonifati, Werner Nutt, Riccardo Torlone, Jan Van den Bussche
Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries. VLDB J. 25 (3) (2016)
Xiaowang Zhang, Jan Van den Bussche, François Picalausa
On the Satisfiability Problem for SPARQL Patterns. J. Artif. Intell. Res. 56 (2016)
Tom J. Ameloot, Jan Van den Bussche
Learning with Value-Ramp. CoRR (2016)
Marcelo Arenas, Peter Buneman, Jan Van den Bussche
2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS (2016)
Dimitri Surinx, George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu
Relative expressive power of navigational querying on graphs using transitive closure. Log. J. IGPL 23 (5) (2015)
Tom J. Ameloot, Jan Van den Bussche
Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors. Neural Comput. 27 (12) (2015)
Tom J. Ameloot, Jan Van den Bussche
Deciding Confluence for a Simple Class of Relational Transducer Networks. Theory Comput. Syst. 57 (4) (2015)
George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu
The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs. Ann. Math. Artif. Intell. 73 (1-2) (2015)
Tom J. Ameloot, Jan Van den Bussche
Convergence in Navigational Reinforcement Learning. CoRR (2015)
Angela Bonifati, Werner Nutt, Riccardo Torlone, Jan Van den Bussche
Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries. CoRR (2015)
Jelle Hellings, Marc Gyssens, Yuqing Wu, Dirk Van Gucht, Jan Van den Bussche, Stijn Vansummeren, George H. L. Fletcher
Relative expressive power of downward fragments of navigational query languages on trees and chains. DBPL (2015)
George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu
Relative expressive power of navigational querying on graphs. Inf. Sci. 298 (2015)
Tom J. Ameloot, Jan Van den Bussche, William R. Marczak, Peter Alvaro, Joseph M. Hellerstein
Putting Logic-Based Distributed Systems on Stable Grounds. CoRR (2015)
Christophe Costa Florêncio, Jonny Daenen, Jan Ramon, Jan Van den Bussche, Dries Van Dyck
Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time. J. Univers. Comput. Sci. 21 (7) (2015)
Xiaowang Zhang, Jan Van den Bussche
On the Power of SPARQL in Expressing Navigational Queries. Comput. J. 58 (11) (2015)
Natalia Kwasnikowska, Luc Moreau, Jan Van den Bussche
A Formal Account of the Open Provenance Model. ACM Trans. Web 9 (2) (2015)
George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. J. Log. Comput. 25 (3) (2015)
Xiaowang Zhang, Jan Van den Bussche
On the primitivity of operators in SPARQL. Inf. Process. Lett. 114 (9) (2014)
Marcelo Arenas, Jonny Daenen, Frank Neven, Martín Ugarte, Jan Van den Bussche, Stijn Vansummeren
Discovering XSD Keys from XML Data. ACM Trans. Database Syst. 39 (4) (2014)
Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche
Inference in the FO(C) Modelling Language. ECAI (2014)
Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche
FO(C): A Knowledge Representation Language of Causality. CoRR (2014)
Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche
Inference in the FO(C) Modelling Language. CoRR (2014)
Xiaowang Zhang, Guohui Xiao, Zuoquan Lin, Jan Van den Bussche
Inconsistency-tolerant reasoning with OWL DL. Int. J. Approx. Reason. 55 (2) (2014)
Tom J. Ameloot, Jan Van den Bussche
Positive Dedalus programs tolerate non-causality. J. Comput. Syst. Sci. 80 (7) (2014)
Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche
FO(C) and Related Modelling Paradigms. CoRR (2014)
Tony Tan, Jan Van den Bussche, Xiaowang Zhang
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference. CoRR (2014)
Xiaowang Zhang, Jan Van den Bussche
On the satisfiability problem for SPARQL patterns. CoRR (2014)
George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu
Relative Expressive Power of Navigational Querying on Graphs. CoRR (2014)
Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche
The DNA query language DNAQL. ICDT (2013)
Tom J. Ameloot, Jan Van den Bussche, Emmanuel Waller
On the expressive power of update primitives. PODS (2013)
Marcelo Arenas, Jonny Daenen, Frank Neven, Martín Ugarte, Jan Van den Bussche, Stijn Vansummeren
Discovering XSD keys from XML data. SIGMOD Conference (2013)
Tom J. Ameloot, Frank Neven, Jan Van den Bussche
Relational transducers for declarative networking. J. ACM 60 (2) (2013)
Jan Van den Bussche, Stijn Vansummeren
Well-Defined NRC Queries Can Be Typed - (Extended Abstract). In Search of Elegance in the Theory and Practice of Computation (2013)
Xin Liang, Zuoquan Lin, Jan Van den Bussche
Quantitatively Evaluating Formula-Variable Relevance by Forgetting. Canadian Conference on AI (2013)
Natalia Kwasnikowska, Jan Van den Bussche
Querying an Integrated Complex-Object Dataflow Database. In Search of Elegance in the Theory and Practice of Computation (2013)
Jan Hidders, Paolo Missier, Jacek Sroka, Jan Van den Bussche
Preface. Fundam. Informaticae 128 (3) (2013)
Jelle Hellings, Bart Kuijpers, Jan Van den Bussche, Xiaowang Zhang
Walk logic as a framework for path query languages on graph databases. ICDT (2013)
Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche
Graph-theoretic formalization of hybridization in DNA sticker complexes. Nat. Comput. 12 (2) (2013)

Jan Van den Bussche.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jan Van den Bussche