Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJan Van den Bussche
Person information
- affiliation: Universiteit Hasselt, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[c96]Xiaowang Zhang, Jan Van den Bussche, Kewen Wang, Zhe Wang:
On the Satisfiability Problem of Patterns in SPARQL 1.1. AAAI 2018: 2054-2062- [c95]Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema:
Expressivity Within Second-Order Transitive-Closure Logic. CSL 2018: 22:1-22:18 - [c94]Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht:
A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries. FoIKS 2018: 360-378 - [c93]Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag:
On the Expressive Power of Query Languages for Matrices. ICDT 2018: 10:1-10:17 - [e4]Jan Van den Bussche, Marcelo Arenas:
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10-15, 2018. ACM 2018 [contents] - [i30]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 abs/1803.01390 (2018) - [i29]Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema:
Expressivity within second-order transitive-closure logic. CoRR abs/1804.05926 (2018) - [i28]Dimitri Surinx, Jan Van den Bussche:
A Monotone Preservation Result for Boolean Queries Expressed as a Containment of Conjunctive Queries. CoRR abs/1808.08822 (2018) - 2017
- [c92]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: 1-10 - [c91]Jan Hidders, Jan Paredaens, Jan Van den Bussche:
J-Logic: Logical Foundations for JSON Querying. PODS 2017: 137-149 - [e3]Emanuel Sallinger, Jan Van den Bussche, Floris Geerts:
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017. ACM 2017, ISBN 978-1-4503-4198-1 [contents] - [i27]Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag:
On the expressive power of query languages for matrices. CoRR abs/1709.08359 (2017) - 2016
- [j73]Xiaowang Zhang, Jan Van den Bussche, François Picalausa:
On the Satisfiability Problem for SPARQL Patterns. J. Artif. Intell. Res. 56: 403-428 (2016) - [j72]Tom J. Ameloot, Jan Van den Bussche, William R. Marczak, Peter Alvaro, Joseph M. Hellerstein:
Putting logic-based distributed systems on stable grounds. TPLP 16(4): 378-417 (2016) - [j71]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): 381-397 (2016) - [c90]Marcelo Arenas, Peter Buneman, Jan Van den Bussche:
2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2016: 11 - [i26]
- 2015
- [j70]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): 167-203 (2015) - [j69]Xiaowang Zhang, Jan Van den Bussche:
On the Power of SPARQL in Expressing Navigational Queries. Comput. J. 58(11): 2841-2851 (2015) - [j68]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. Logic Journal of the IGPL 23(5): 759-788 (2015) - [j67]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: 390-406 (2015) - [j66]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. UCS 21(7): 891-911 (2015) - [j65]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): 549-580 (2015) - [j64]Tom J. Ameloot, Jan Van den Bussche:
Deciding Confluence for a Simple Class of Relational Transducer Networks. Theory Comput. Syst. 57(4): 1038-1111 (2015) - [j63]Tom J. Ameloot, Jan Van den Bussche:
Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors. Neural Computation 27(12): 2623-2660 (2015) - [j62]Natalia Kwasnikowska, Luc Moreau, Jan Van den Bussche:
A Formal Account of the Open Provenance Model. TWEB 9(2): 10:1-10:44 (2015) - [c89]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: 59-68 - [e2]Gustavo Alonso, Floris Geerts, Lucian Popa, Pablo Barceló, Jens Teubner, Martín Ugarte, Jan Van den Bussche, Jan Paredaens:
Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, March 23-27, 2015. OpenProceedings.org 2015 [contents] - [i25]Angela Bonifati, Werner Nutt, Riccardo Torlone, Jan Van den Bussche:
Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries. CoRR abs/1503.01707 (2015) - [i24]Tom J. Ameloot, Jan Van den Bussche, William R. Marczak, Peter Alvaro, Joseph M. Hellerstein:
Putting Logic-Based Distributed Systems on Stable Grounds. CoRR abs/1507.05539 (2015) - [i23]Tom J. Ameloot, Jan Van den Bussche:
Convergence in Navigational Reinforcement Learning. CoRR abs/1511.08724 (2015) - 2014
- [j61]Xiaowang Zhang, Guohui Xiao, Zuoquan Lin, Jan Van den Bussche:
Inconsistency-tolerant reasoning with OWL DL. Int. J. Approx. Reasoning 55(2): 557-584 (2014) - [j60]Xiaowang Zhang, Jan Van den Bussche:
On the primitivity of operators in SPARQL. Inf. Process. Lett. 114(9): 480-485 (2014) - [j59]Tom J. Ameloot, Jan Van den Bussche:
Positive Dedalus programs tolerate non-causality. J. Comput. Syst. Sci. 80(7): 1191-1213 (2014) - [j58]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): 28:1-28:49 (2014) - [c88]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
Inference in the FO(C) Modelling Language. ECAI 2014: 111-116 - [i22]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 abs/1401.8201 (2014) - [i21]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
Inference in the FO(C) Modelling Language. CoRR abs/1404.6368 (2014) - [i20]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
FO(C) and Related Modelling Paradigms. CoRR abs/1404.6394 (2014) - [i19]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
FO(C): A Knowledge Representation Language of Causality. CoRR abs/1405.1833 (2014) - [i18]Tony Tan, Jan Van den Bussche, Xiaowang Zhang:
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference. CoRR abs/1406.0349 (2014) - [i17]Xiaowang Zhang, Jan Van den Bussche:
On the satisfiability problem for SPARQL patterns. CoRR abs/1406.1404 (2014) - 2013
- [j57]Jan Hidders, Paolo Missier, Jacek Sroka, Jan Van den Bussche:
Preface. Fundam. Inform. 128(3) (2013) - [j56]Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. J. ACM 60(2): 15:1-15:38 (2013) - [j55]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
Graph-theoretic formalization of hybridization in DNA sticker complexes. Natural Computing 12(2): 223-234 (2013) - [c87]Xin Liang, Zuoquan Lin, Jan Van den Bussche:
Quantitatively Evaluating Formula-Variable Relevance by Forgetting. Canadian Conference on AI 2013: 271-277 - [c86]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: 400-417 - [c85]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: 494-506 - [c84]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
The DNA query language DNAQL. ICDT 2013: 1-9 - [c83]Jelle Hellings, Bart Kuijpers, Jan Van den Bussche, Xiaowang Zhang:
Walk logic as a framework for path query languages on graph databases. ICDT 2013: 117-128 - [c82]Tom J. Ameloot, Jan Van den Bussche, Emmanuel Waller:
On the expressive power of update primitives. PODS 2013: 139-150 - [c81]Marcelo Arenas, Jonny Daenen, Frank Neven, Martín Ugarte, Jan Van den Bussche, Stijn Vansummeren:
Discovering XSD keys from XML data. SIGMOD Conference 2013: 61-72 - 2012
- [j54]Michal Bielecki, Jan Hidders, Jan Paredaens, Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bussche:
The Navigational Power of Web Browsers. Theory Comput. Syst. 50(2): 213-240 (2012) - [j53]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
A comparison of graph-theoretic DNA hybridization models. Theor. Comput. Sci. 429: 46-53 (2012) - [c80]
- [c79]
- [c78]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 Boolean Expressiveness of Navigational Query Languages on Graphs. FoIKS 2012: 124-143 - [c77]Tom J. Ameloot, Jan Van den Bussche:
Deciding eventual consistency for a simple class of relational transducer networks. ICDT 2012: 86-98 - [i16]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. CoRR abs/1210.2688 (2012) - 2011
- [j52]Luc Moreau, Ben Clifford, Juliana Freire, Joe Futrelle, Yolanda Gil, Paul T. Groth, Natalia Kwasnikowska, Simon Miles, Paolo Missier, Jim Myers, Beth Plale, Yogesh Simmhan, Eric G. Stephan, Jan Van den Bussche:
The Open Provenance Model core specification (v1.1). Future Generation Comp. Syst. 27(6): 743-756 (2011) - [j51]Floris Geerts, Jan Van den Bussche:
Relational completeness of query languages for annotated databases. J. Comput. Syst. Sci. 77(3): 491-504 (2011) - [c76]Robert Brijder, Joris J. M. Gillis, Jan Van den Bussche:
Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes. DNA 2011: 49-63 - [c75]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. ICDT 2011: 197-207 - [c74]Joris J. M. Gillis, Jan Van den Bussche:
Expressive Power of Safe First-Order Logical Decision Trees. ILP 2011: 160-172 - [c73]Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. PODS 2011: 283-292 - 2010
- [j50]George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Towards a theory of search queries. ACM Trans. Database Syst. 35(4): 28:1-28:33 (2010) - [c72]
- [c71]
- [c70]Umut A. Acar, Peter Buneman, James Cheney, Jan Van den Bussche, Natalia Kwasnikowska, Stijn Vansummeren:
A Graph Model of Data and Workflow Provenance. TaPP 2010 - [i15]Eveline Hoekx, Jan Van den Bussche:
Mining tree-query associations in graphs. CoRR abs/1008.2626 (2010) - [i14]Tom J. Ameloot, Frank Neven, Jan Van den Bussche:
Relational transducers for declarative networking. CoRR abs/1012.2858 (2010)
2000 – 2009
- 2009
- [j49]Dirk Leinders, Jan Van den Bussche:
Repetitions and permutations of columns in the semijoin algebra. ITA 43(2): 179-187 (2009) - [j48]Victor Vianu, Jan Van den Bussche:
Introduction to PODS 2006 special section. J. ACM 56(3): 11:1 (2009) - [j47]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. 44(4): 533-560 (2009) - [c69]George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Towards a theory of search queries. ICDT 2009: 201-211 - [c68]Joris J. M. Gillis, Jan Van den Bussche:
Induction of Relational Algebra Expressions. ILP 2009: 25-33 - 2008
- [j46]Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche:
DFL: A dataflow language based on Petri nets and nested relational calculus. Inf. Syst. 33(3): 261-284 (2008) - [j45]Stefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche:
Learning ( k , l )-contextual tree languages for information extraction from web pages. Machine Learning 71(2-3): 155-183 (2008) - [c67]Natalia Kwasnikowska, Jan Van den Bussche:
Mapping the NRC Dataflow Model to the Open Provenance Model. IPAW 2008: 3-16 - 2007
- [j44]Wim Janssen, Alexandr Korlyukov, Jan Van den Bussche:
On the tree-transformation power of XSLT. Acta Inf. 43(6): 371-393 (2007) - [j43]Dirk Leinders, Jan Van den Bussche:
On the complexity of division and set joins in the relational algebra. J. Comput. Syst. Sci. 73(4): 538-549 (2007) - [j42]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-definedness and semantic type-checking for the nested relational calculus. Theor. Comput. Sci. 371(3): 183-199 (2007) - [j41]Jan Van den Bussche, Stijn Vansummeren:
Polymorphic type inference for the named nested relational calculus. ACM Trans. Comput. Log. 9(1): 3 (2007) - [j40]Jan Van den Bussche:
Introduction to the PODS 2006 special section. ACM Trans. Database Syst. 32(4): 24 (2007) - [c66]Kerstin Koch, Stefan Schönauer, Ivy Jansen, Jan Van den Bussche, Tomasz Burzykowski:
Finding Clusters of Positive and Negative Coregulated Genes in Gene Expression Data. BIBE 2007: 93-99 - [c65]Floris Geerts, Jan Van den Bussche:
Relational Completeness of Query Languages for Annotated Databases. DBPL 2007: 127-137 - [c64]
- [c63]Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche:
A Formal Model of Dataflow Repositories. DILS 2007: 105-121 - [c62]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. ICDT 2007: 284-298 - [c61]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
A crash course on database queries. PODS 2007: 143-154 - [i13]
- 2006
- [j39]Raymond Kosala, Hendrik Blockeel, Maurice Bruynooghe, Jan Van den Bussche:
Information extraction from structured documents using k-testable tree automaton inference. Data Knowl. Eng. 58(2): 129-158 (2006) - [j38]Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke:
A characterization of first-order topological properties of planar spatial data. J. ACM 53(2): 273-305 (2006) - [j37]Floris Geerts, Bart Kuijpers, Jan Van den Bussche:
Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases. SIAM J. Comput. 35(6): 1386-1439 (2006) - [j36]
- [c60]
- [c59]Floris Geerts, Peter Z. Revesz, Jan Van den Bussche:
On-line maintenance of simplified weighted graphs for efficient distance queries. GIS 2006: 203-210 - [c58]Eveline Hoekx, Jan Van den Bussche:
Mining for Tree-Query Associations in a Graph. ICDM 2006: 254-264 - [i12]Wim Janssen, Alexandr Korlyukov, Jan Van den Bussche:
On the tree-transformation power of XSLT. CoRR abs/cs/0603028 (2006) - [i11]Floris Geerts, Peter Z. Revesz, Jan Van den Bussche:
On-line topological simplification of weighted graphs. CoRR abs/cs/0608091 (2006) - 2005
- [j35]Floris Geerts, Lieven Smits, Jan Van den Bussche:
N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets. Acta Inf. 42(1): 43-56 (2005) - [j34]
- [j33]Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen:
Towards practical meta-querying. Inf. Syst. 30(4): 317-332 (2005) - [j32]Dirk Leinders, Maarten Marx, Jerzy Tyszkiewicz, Jan Van den Bussche:
The Semijoin Algebra and the Guarded Fragment. Journal of Logic, Language and Information 14(3): 331-343 (2005) - [j31]Floris Geerts, Bart Goethals, Jan Van den Bussche:
Tight upper bounds on the number of candidate patterns. ACM Trans. Database Syst. 30(2): 333-363 (2005) - [c57]Bart Goethals, Eveline Hoekx, Jan Van den Bussche:
Mining Tree Queries in a Graph. BNAIC 2005: 345-346 - [c56]Stefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche:
Learning (k, l)-Contextual Tree Languages for Information Extraction. ECML 2005: 305-316 - [c55]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery Extended Abstract. ICDT 2005: 99-113 - [c54]
- [c53]Jan Hidders, Natalia Kwasnikowska, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche:
Petri Net + Nested Relational Calculus = Dataflow. OTM Conferences (1) 2005: 220-237 - [c52]Dirk Leinders, Jan Van den Bussche:
On the complexity of division and set joins in the relational algebra. PODS 2005: 76-83 - 2004
- [j30]Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche:
On the expressive power of semijoin queries. Inf. Process. Lett. 91(2): 93-98 (2004) - [j29]Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche:
Solving Equations in the Relational Algebra. SIAM J. Comput. 33(5): 1052-1066 (2004) - [c51]Jan Van den Bussche:
Finite Cursor Machines in Database Query Processing. Abstract State Machines 2004: 61 - [c50]Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen:
Meta-SQL: Towards Practical Meta-Querying. EDBT 2004: 823-825 - [c49]Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke:
A Characterization of First-Order Topological Properties of Planar Spatial Data. PODS 2004: 107-114 - [c48]Geert Jan Bex, Frank Neven, Jan Van den Bussche:
DTDs versus XML Schema: A Practical Study. WebDB 2004: 79-84 - [i10]Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery. CoRR cs.DB/0406060 (2004) - [i9]Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche:
The semijoin algebra and the guarded fragment. CoRR cs.DB/0407007 (2004) - 2003
- [c47]Michal Bielecki, Jan Van den Bussche:
Database Interrogation Using Conjunctive Queries. ICDT 2003: 259-269 - [c46]Raymond Kosala, Maurice Bruynooghe, Jan Van den Bussche, Hendrik Blockeel:
Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference. IJCAI 2003: 403-408 - [i8]Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche:
On the expressive power of semijoin queries. CoRR cs.DB/0308014 (2003) - [i7]Floris Geerts, Lieven Smits, Jan Van den Bussche:
Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets. CoRR cs.LO/0308001 (2003) - 2002
- [j28]Andreas Blass, Yuri Gurevich, Jan Van den Bussche:
Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174(1): 20-36 (2002) - [j27]Frank Neven, Jan Van den Bussche:
Expressiveness of structured document query languages based on attribute grammars. J. ACM 49(1): 56-100 (2002) - [j26]Jan Van den Bussche, Emmanuel Waller:
Polymorphic Type Inference for the Relational Algebra. J. Comput. Syst. Sci. 64(3): 694-718 (2002) - [c45]Bart Goethals, Jan Van den Bussche:
Relational Association Rules: Getting WARMeR. Pattern Detection and Discovery 2002: 125-139 - [c44]